Infinitely complex machines

In Intelligent Computing Everywhere. Springer. pp. 25-43 (2007)

Authors
Eric Steinhart
William Paterson University of New Jersey
Abstract
Infinite machines (IMs) can do supertasks. A supertask is an infinite series of operations done in some finite time. Whether or not our universe contains any IMs, they are worthy of study as upper bounds on finite machines. We introduce IMs and describe some of their physical and psychological aspects. An accelerating Turing machine (an ATM) is a Turing machine that performs every next operation twice as fast. It can carry out infinitely many operations in finite time. Many ATMs can be connected together to form networks of infinitely powerful agents. A network of ATMs can also be thought of as the control system for an infinitely complex robot. We describe a robot with a dense network of ATMs for its retinas, its brain, and its motor controllers. Such a robot can perform psychological supertasks - it can perceive infinitely detailed objects in all their detail; it can formulate infinite plans; it can make infinitely precise movements. An endless hierarchy of IMs might realize a deep notion of intelligent computing everywhere.
Keywords computers  infinity
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 40,785
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Supermachines and Superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
Infinite Time Turing Machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Logically Possible Machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.
Infinite Time Turing Machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
A Proof of the Impossibility of Completing Infinitely Many Tasks.Jeremy Gwiazda - 2012 - Pacific Philosophical Quarterly 93 (1):1-7.
Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Philosophical Implications of Inflationary Cosmology.Joshua Knobe, Ken D. Olum & And Alexander Vilenkin - 2006 - British Journal for the Philosophy of Science 57 (1):47-67.
Infinity in Ethics.Peter Vallentyne - unknown - Routledge Encyclopedia of Philosophy.
Is the Human Mind a Turing Machine?D. King - 1996 - Synthese 108 (3):379-89.

Analytics

Added to PP index
2010-10-31

Total views
0

Recent downloads (6 months)
0

How can I increase my downloads?

Downloads

Sorry, there are not enough data points to plot this chart.

My notes

Sign in to use this feature