Computations via experiments with kinematic systems (2004)

by E. J. Beggs , J. V. Tucker , Singleton Park
Citations:10 - 2 self

Documents Related by Co-Citation

283 Classical Recursion Theory – P Odifreddi - 1999
46 The wave equation with computable initial data such that its unique solution is not computable – M Pour-El and J I Richards - 1981
16 Church's thesis meets the N-body problem – Warren D. Smith - 1999
77 Unpredictability and undecidability in dynamical systems – C D Moore - 1990
24 Hypercomputation: computing more than the turing machine – T Ord - 2002
52 Non-Turing computations via Malament-Hogarth space-times – Gábor Etesi , István Németi - 2002
9 Can Newtonian systems bounded in space, time, mass and energy compute all functions? Theoretical Computer Science 371 – E Beggs, J Tucker - 2007
51 Quantum Algorithm For Hilberts Tenth Problem – Tien D Kieu - 2003
97 Systems of Logic Based on Ordinals – A M Turing - 1939
8 Coupled map lattices as computational systems – A V Holden, J V Tucker, H Zhang, M Poole - 1992
5 Is wave propogation computable or can wave computers beat the Turing machine – K Weihrauch, N Zhong - 2002
4 Classical physics and the Church Turing thesis – A Yao
26 Rubel,A differentially algebraic replacement theorem, and analog computation – L Lipshitz, L A - 1987
55 Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers – M B Pour-El - 1974
12 Computable and continuous partial homomorphisms on metric partial algebras – V Stoltenberg-Hansen, J Tucker
112 Neural Networks and Analog Computation: Beyond the Turing limit – H T Siegelmann - 1999
27 Concrete models of computation for topological algebras – V Stoltenberg-Hansen, J V Tucker - 1999
23 Abstract versus concrete computation on metric partial algebras – J. V. Tucker, J. I. Zucker - 2004
13 A notion of mechanistic theory,” Synthese 29 – G Kreisel - 1974