Abstract
Is there any common algorithmic principle behind the evolution of the universe, of life, of the mind? Should the currently prevailing computational paradigms which are limited by the Church-Turing thesis be revised in favor of more powerful ones? Can real systems exist whose computational power is provably greater than that of Turing machines? Is there a computational theory of everything? These are provocative questions that should be on the agenda of computer science for the next decade.
This research was supported by GA CR Grant No. 201/00/1489
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiedermann, J. (2000). Towards a Computational Theory of Everything. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. TCS 2000. Lecture Notes in Computer Science, vol 1872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44929-9_47
Download citation
DOI: https://doi.org/10.1007/3-540-44929-9_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67823-6
Online ISBN: 978-3-540-44929-4
eBook Packages: Springer Book Archive