From the Closed Classical Algorithmic Universe to an Open World of Algorithmic Constellations
Artikel i vetenskaplig tidskrift, 2013

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.

Unconventional algorithms unconventional computing algorithmic constellations Computing beyond Turing machine model

Författare

Mark Burgin

Gordana Dodig Crnkovic

Chalmers, Tillämpad informationsteknologi

COMPUTING NATURE, Volume 7 of the series Studies in Applied Philosophy, Epistemology and Rational Ethics

241-253

Ämneskategorier

Data- och informationsvetenskap

ISBN

978-3-642-37224-7