Supermachines and superminds

Minds and Machines 13 (1):155-186 (2003)
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
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,781
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Three Paradigms of Computer Science.Amnon H. Eden - 2007 - Minds and Machines 17 (2):135-167.
On the Plurality of Gods.Eric Steinhart - 2013 - Religious Studies 49 (3):289-312.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
54 ( #100,544 of 2,199,428 )

Recent downloads (6 months)
1 ( #299,438 of 2,199,428 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature