Infinitely Complex Machines

In Intelligent Computing Everywhere. Springer. pp. 25-43 (2007)
Download Edit this record How to cite View on PhilPapers
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
PhilPapers/Archive ID
STEICM
Upload history
Archival date: 2020-02-22
View other versions
Added to PP index
2010-10-31

Total views
204 ( #31,676 of 65,651 )

Recent downloads (6 months)
52 ( #16,096 of 65,651 )

How can I increase my downloads?

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