Logically possible machines

Minds and Machines 12 (2):259-280 (2002)
Authors
Eric Steinhart
William Paterson University of New Jersey
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.
Keywords convergence  fixed-point  infinite algorithm  infinite machine  infinite mind  limit  possible world  situation  super-Turing computer
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1015603317236
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 35,445
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total downloads
51 ( #124,800 of 2,285,005 )

Recent downloads (6 months)
5 ( #95,735 of 2,285,005 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature