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

In Gordana Dodig-Crnkovic Raffaela Giovagnoli (ed.), Computing Nature. pp. 241--253 (2013)
  Copy   BIBTEX

Abstract

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 Goedels 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.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2014-01-26

Downloads
94 (#187,657)

6 months
243 (#10,628)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Gordana Dodig Crnkovic
Chalmers University of Technology

Citations of this work

No citations found.

Add more citations

References found in this work

Some Remarks on the Undecidability Results.Kurt Gödel - 1990 - In Solomon Feferman, John Dawson & Stephen Kleene (eds.), Kurt Gödel: Collected Works Vol. Ii. Oxford University Press. pp. 305--306.

Add more references