Logically possible machines

Minds and Machines 12 (2):259-280 (2002)
Download Edit this record How to cite View on PhilPapers
Abstract
I use modal logic and transfinite set-theory to define metaphysical foundations for a general theory of computation. A possible universe is a certain kind of situation; a situation is a set of facts. An algorithm is a certain kind of inductively defined property. A machine is a series of situations that instantiates an algorithm in a certain way. There are finite as well as transfinite algorithms and machines of any degree of complexity (e.g., Turing and super-Turing machines and more). There are physically and metaphysically possible machines. There is an iterative hierarchy of logically possible machines in the iterative hierarchy of sets. Some algorithms are such that machines that instantiate them are minds. So there is an iterative hierarchy of finitely and transfinitely complex minds.
Reprint years
2004
PhilPapers/Archive ID
STELPM
Upload history
Archival date: 2020-02-22
View other versions
Added to PP index
2009-01-28

Total views
172 ( #28,095 of 55,904 )

Recent downloads (6 months)
39 ( #20,171 of 55,904 )

How can I increase my downloads?

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