Natural computation and non-Turing models of computation

DOI10.1016/j.tcs.2003.12.008zbMath1072.68041OpenAlexW2111129500MaRDI QIDQ1434372

Bruce J. MacLennan

Publication date: 4 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.008

zbMATH Keywords

Turing machineAnalog computationNatural computationComputation on realsContinuous computation

Mathematics Subject Classification ID

Related Items (5)

Pattern-based computing via sequential phase transitions in hierarchical mean field neuropercolation ⋮ The promise of analog computation ⋮ The case for hypercomputation ⋮ Matrix splicing system ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursion theory on the reals and continuous-time computation
• The extended analog computer
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• The promise of analog computation
• Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression
• A universal differential equation
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• The Theory of Representation for Boolean Algebras
• Applications of the Theory of Boolean Rings to General Topology
• Mathematical Theory of the Differential Analyzer

This page was built for publication: Natural computation and non-Turing models of computation