Supermachines and superminds

Minds and Machines 13 (1):155-186 (2003)
Download Edit this record How to cite View on PhilPapers
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.
Reprint years
2004
PhilPapers/Archive ID
STESAS
Upload history
Archival date: 2020-02-22
View other versions
Added to PP index
2009-01-28

Total views
242 ( #25,906 of 2,448,218 )

Recent downloads (6 months)
26 ( #25,471 of 2,448,218 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.