Wednesday, September 29, 2010

Eric Steinhart, Supermachines and superminds | PhilPapers

Eric Steinhart, Supermachines and superminds | PhilPapers

Eric Steinhart (2003). Supermachines and Superminds. Minds and Machines 13 (1).
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.

New in CogSciFi 09/29/2010

  • It is not too hard to construct "minds" that cannot be reconstructed easily from outputs. Consider a cryptographically secure pseudorandom number generator: watching the first k bits will not allow you to predict the k+1 bit with more than 50% probability, until you have run through the complete statespace (requires up to ~2^(number of state bits) output bits). This "mind" is not reconstructible from its output in any useful way.
Posted from Diigo. The rest of my favorite links are here.

Thursday, September 16, 2010


Related Posts Plugin for WordPress, Blogger...