|Abstract||It is fairly well-known that certain hard computational problems (that is, 'difficult' problems for a digital processor to solve) can in fact be solved much more easily with an analog machine. This raises questions about the true nature of the distinction between analog and digital computation (if such a distinction exists). I try to analyze the source of the observed difference in terms of (1) expanding parallelism and (2) more generally, infinite-state Turing machines. The issue of discreteness vs continuity will also be touched upon, although it is not so important for analyzing these particular problems.|
|Keywords||No keywords specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
William Demopoulos (1987). On Some Fundamental Distinctions of Computationalism. Synthese 70 (January):79-96.
Kazuyuki Aihara & Jun Kyung Ryeu (2001). Chaotic Neurons and Analog Computation. Behavioral and Brain Sciences 24 (5):810-811.
John Haugeland (1981). Analog and Analog. Philosophical Topics 12 (1):213-226.
Hava T. Siegelmann (2003). Neural and Super-Turing Computing. Minds and Machines 13 (1):103-114.
Corey J. Maley (2011). Analog and Digital, Continuous and Discrete. Philosophical Studies 155 (1):117-131.
Russell Trenholme (1994). Analog Simulation. Philosophy of Science 61 (1):115-131.
Matthew Katz (2008). Analog and Digital Representation. Minds and Machines 18 (3).
Rahul Sarpeshkar (1998). Analog Versus Digital: Extrapolating From Electronics to Neurobiology. Neural Computation 10 (7):1601--1638.
Added to index2009-01-28
Total downloads184 ( #1,596 of 549,113 )
Recent downloads (6 months)7 ( #10,383 of 549,113 )
How can I increase my downloads?