Infinitely complex machines
In Intelligent Computing Everywhere. Springer. pp. 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)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Logical Operations and Iterated Infinitely Deep Languages.Juha Oikkonen - 1983 - Studia Logica 42 (2-3):243 - 249.
On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.
Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
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.
Symbionomic Evolution: From Complexity and Systems Theory, to Chaos Theory and Coevolution.Joël De Rosnay - 2011 - World Futures 67 (4-5):304 - 315.
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.
Observability of Turing Machines: A Refinement of the Theory of Computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
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?