Minds and Machines 13 (1):155-186 (2003)
AbstractIf the computational theory of mind is right, then minds are realized by machines. There is an ordered complexity hierarchy of machines. Some finite machines realize finitely complex minds; some Turing machines realize potentially infinitely complex minds. There are many logically possible machines whose powers exceed the Church–Turing limit (e.g. accelerating Turing machines). Some of these supermachines realize superminds. Superminds perform cognitive supertasks. Their thoughts are formed in infinitary languages. They perceive and manipulate the infinite detail of fractal objects. They have infinitely complex bodies. Transfinite games anchor their social relations.
Similar books and articles
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
Infinitely Complex Machines.Eric Steinhart - 2007 - In Intelligent Computing Everywhere. Springer. pp. 25-43.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
The church-Turing thesis and effective mundane procedures.Leon Horsten - 1995 - Minds and Machines 5 (1):1-8.
Computing machines can't be intelligent (...And Turing said so).Peter Kugel - 2002 - Minds and Machines 12 (4):563-579.
Added to PP
Historical graph of downloads
Citations of this work
References found in this work
Psychosemantics: The Problem of Meaning in the Philosophy of Mind.Jerry A. Fodor - 1987 - MIT Press.
On the Plurality of Worlds.David K. Lewis - 1986 - Revue Philosophique de la France Et de l'Etranger 178 (3):388-390.