Minds and Machines 13 (1):155-186 (2003)
| Authors |
|
| Abstract |
If 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.
|
| Keywords | complexity divine mind supertask infinite mind infinite computer |
| Categories | (categorize this paper) |
| Reprint years | 2004 |
| DOI | 10.1023/A:1021307923600 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
External links
- From the Publisher via CrossRef (no proxy)
- dl.acm.org (no proxy)
- dl.acm.org [2] (no proxy)
- dl.acm.org [3] (no proxy)
- dl.acm.org [4] (no proxy)
- dl.acm.org [5] (no proxy)
- dx.doi.org (no proxy)
- ericsteinhart.com
(no proxy) - link.springer.com (no proxy)
- link.springer.com [2] (no proxy)
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
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
Psychosemantics: The Problem of Meaning in the Philosophy of Mind.Jerry A. Fodor - 1987 - MIT Press.
On the Plurality of Worlds.David Lewis - 1986 - Revue Philosophique de la France Et de l'Etranger 178 (3):388-390.
View all 53 references / Add more references
Citations of this work BETA
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.
Analytics
Added to PP index
2009-01-28
Total views
267 ( #37,587 of 2,462,867 )
Recent downloads (6 months)
32 ( #26,919 of 2,462,867 )
2009-01-28
Total views
267 ( #37,587 of 2,462,867 )
Recent downloads (6 months)
32 ( #26,919 of 2,462,867 )
How can I increase my downloads?
Downloads
