Programming Experimental Procedures for Newtonian Kinematic Machines

DOI10.1007/978-3-540-69407-6_6zbMath1143.68015OpenAlexW1482021928MaRDI QIDQ3507418

J. V. Tucker, Edwin J. Beggs

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_6

Mathematics Subject Classification ID

Related Items (2)

Limits to measurement in experiments governed by algorithms ⋮ Computations via Newtonian and relativistic kinematic systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
• Conservative logic
• Classical recursion theory. The theory of functions and sets of natural numbers
• A notion of mechanistic theory
• Concrete models of computation for topological algebras
• Handbook of computability theory
• Embedding infinitely parallel computation in Newtonian kinematics
• Classical physics and the Church--Turing Thesis
• Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
• Abstract versus concrete computation on metric partial algebras
• Experimental computation of real numbers by Newtonian machines
• Computational complexity with experiments as oracles

This page was built for publication: Programming Experimental Procedures for Newtonian Kinematic Machines