CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

From the Closed Classical Algorithmic Universe to an Open World of Algorithmic Constellations

Mark Burgin ; Gordana Dodig-Crnkovic (Institutionen för tillämpad informationsteknologi (Chalmers))
COMPUTING NATURE, Volume 7 of the series Studies in Applied Philosophy, Epistemology and Rational Ethics p. 241-253. (2013)
[Artikel, refereegranskad vetenskaplig]

In this paper we analyze methodological and philosophical implications of algorithmic aspects of unconventional computation. At first, we describe how the classical algorithmic universe developed and analyze why it became closed in the conventional approach to computation. Then we explain how new models of algorithms turned the classical closed algorithmic universe into the open world of algorithmic constellations, allowing higher flexibility and expressive power, supporting constructivism and creativity in mathematical modeling. As Gödel’s undecidability theorems demonstrate, the closed algorithmic universe restricts essential forms of mathematical cognition. In contrast, the open algorithmic universe, and even more the open world of algorithmic constellations, remove such restrictions and enable new, richer understanding of computation.

Nyckelord: Unconventional algorithms unconventional computing algorithmic constellations Computing beyond Turing machine model



Denna post skapades 2016-03-02. Senast ändrad 2016-09-15.
CPL Pubid: 232676

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för tillämpad informationsteknologi (Chalmers)

Ämnesområden

Data- och informationsvetenskap

Chalmers infrastruktur