Computations via experiments with kinematic systems (2004)

by E. J. Beggs , J. V. Tucker , Singleton Park
Citations:13 - 4 self

Documents Related by Co-Citation

89 Unpredictability and undecidability in dynamical systems – C Moore - 1990
31 Hypercomputation: computing more than the Turing machine – Toby Ord - 2002
55 The wave equation with computable initial data such that its unique solution is not computable – M B Pour-El and J I Richards - 1981
22 Church's thesis meets the N-body problem – Warren D. Smith - 1999
59 Quantum Algorithm For Hilberts Tenth Problem – Tien D Kieu - 2003
15 Computable and continuous partial homomorphisms on metric partial algebras – V Stoltenberg-Hansen, J V Tucker - 2003
141 Neural Networks and Analog Computation: Beyond the Turing Limit – H T Siegelmann - 1999
66 Abstract computability and its relations to the general purpose analog computer – M B Pour-El - 1974
28 Abstract versus concrete computation on metric partial algebras – J. V. Tucker - 2004
31 Concrete models of computation for topological algebras, Theoretical Computer Science 219 – V Stoltenberg-Hansen, J V Tucker - 1999
18 A notion of mechanistic theory, Synthese 29 – G Kreisel - 1974
7 Is wave propogation computable or can wave computers beat the Turing machine – K Weihrauch, N Zhong - 2002
6 Classical physics and the Church Turing thesis – A Yao
11 Coupled map lattices as computational systems – A V Holden, J V Tucker, H Zhang, M Poole - 1992
11 Can Newtonian systems, bounded in space, time, mass and energy compute all functions? – E. J. Beggs, J. V. Tucker
307 Classical Recursion Theory – P Odifreddi - 1989
6 A da Costa and F A Doria, Classical physics and – N C - 1991
6 A da Costa and F A Doria, Undecidability and incompleteness in classical mechanics – N C - 1991
7 A Nielsen and I – M - 2000