Infinitely complex machines
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
In Intelligent Computing Everywhere. Springer 25-43 (2007)
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.
|Categories||categorize this paper)|
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.
Citations of this work BETA
No citations found.
Similar books and articles
Eric Steinhart (2003). Supermachines and Superminds. Minds and Machines 13 (1):155-186.
Juha Oikkonen (1983). Logical Operations and Iterated Infinitely Deep Languages. Studia Logica 42 (2-3):243 - 249.
Joel David Hamkins (2002). Infinite Time Turing Machines. Minds and Machines 12 (4):567-604.
Vincent C. Müller (2011). On the Possibilities of Hypercomputing Supertasks. Minds and Machines 21 (1):83-96.
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
Eric Steinhart (2002). Logically Possible Machines. Minds and Machines 12 (2):259-280.
Joel David Hamkins & Andy Lewis (2000). Infinite Time Turing Machines. Journal of Symbolic Logic 65 (2):567-604.
Jeremy Gwiazda (2012). A Proof of the Impossibility of Completing Infinitely Many Tasks. Pacific Philosophical Quarterly 93 (1):1-7.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
Joël De Rosnay (2011). Symbionomic Evolution: From Complexity and Systems Theory, to Chaos Theory and Coevolution. World Futures 67 (4-5):304 - 315.
Joshua Knobe, Ken D. Olum & And Alexander Vilenkin (2006). Philosophical Implications of Inflationary Cosmology. British Journal for the Philosophy of Science 57 (1):47-67.
Peter Vallentyne, Infinity in Ethics. Routledge Encyclopedia of Philosophy.
D. King (1996). Is the Human Mind a Turing Machine? Synthese 108 (3):379-89.
Jack Copeland (1996). On Alan Turing's Anticipation of Connectionism. Synthese 108 (3):361-377.
Sorry, there are not enough data points to plot this chart.
Added to index2010-10-31
Recent downloads (6 months)0
How can I increase my downloads?