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)

Authors
Gordana Dodig Crnkovic
Chalmers University of Technology
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.
Keywords unconventional computation  computationalism  algorithms and algorithmic constellations
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

An Argument Against the Plausibility of Church's Thesis.László Kalmár - 1957 - In A. Heyting (ed.), ¸ Iteheyting:Cim. Amsterdam: North-Holland Pub. Co.. pp. 72--80.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Is Evolution Algorithmic?Marcin Miłkowski - 2009 - Minds and Machines 19 (4):465-475.
Algorithmic Information Theory.Michiel van Lambalgen - 1989 - Journal of Symbolic Logic 54 (4):1389-1400.
Algorithmic Randomness and Measures of Complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Algorithmic Randomness in Empirical Data.W. J. - 2003 - Studies in History and Philosophy of Science Part A 34 (3):633-646.
Algorithmic Logic. Multiple-Valued Extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.

Analytics

Added to PP index
2014-01-26

Total views
52 ( #169,440 of 2,285,434 )

Recent downloads (6 months)
18 ( #46,994 of 2,285,434 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature