Natural computation and non-Turing models of computation

DOI10.1016/J.TCS.2003.12.008MaRDI QIDQ1434372zbMATH OpenOpenAlexFDO

Authors 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

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 45545
• scientific article; zbMATH DE number 1131220
• Natural computing algorithms
• The nature of computation
• Computational complexity in non-Turing models of computation: the what, the why and the how
• Research development of natural computation
• Computational mechanisms and models of computation
• Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation
• Models of computation
• On Models of a Nondeterministic Computation

Cites work

• scientific article; zbMATH DE number 3146217 (Why is no real title available?)
• scientific article; zbMATH DE number 497572 (Why is no real title available?)
• scientific article; zbMATH DE number 194534 (Why is no real title available?)
• scientific article; zbMATH DE number 1909819 (Why is no real title available?)
• scientific article; zbMATH DE number 3254647 (Why is no real title available?)
• scientific article; zbMATH DE number 3185475 (Why is no real title available?)
• scientific article; zbMATH DE number 3096290 (Why is no real title available?)
• scientific article; zbMATH DE number 3098483 (Why is no real title available?)
• A universal differential equation
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• Applications of the Theory of Boolean Rings to General Topology
• Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression
• Mathematical Theory of the Differential Analyzer
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Recursion theory on the reals and continuous-time computation
• The Theory of Representation for Boolean Algebras
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• The extended analog computer
• The promise of analog computation

Cited in

(12)

• scientific article; zbMATH DE number 1131220 (Why is no real title available?)
• A natural generalization of the Turing computability model
• A Survey on Analog Models of Computation
• Pattern-based computing via sequential phase transitions in hierarchical mean field neuropercolation
• The promise of analog computation
• Computational complexity in non-Turing models of computation: the what, the why and the how
• Matrix splicing system
• Speedup for natural problems and noncomputability
• SOFSEM 2006: Theory and Practice of Computer Science
• New Models of Computation
• scientific article; zbMATH DE number 1909819 (Why is no real title available?)
• The case for hypercomputation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434372)