{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:39:27Z","timestamp":1725514767127},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694052"},{"type":"electronic","value":"9783540694076"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69407-6_6","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T13:39:35Z","timestamp":1213105175000},"page":"52-66","source":"Crossref","is-referenced-by-count":3,"title":["Programming Experimental Procedures for Newtonian Kinematic Machines"],"prefix":"10.1007","author":[{"given":"E. J.","family":"Beggs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. V.","family":"Tucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"101","volume-title":"From Utopian to Genuine Unconventional Computers","author":"S.G. Akl","year":"2006","unstructured":"Akl, S.G.: Conventional or unconventional: Is any computer universal? In: Adamatzky, A., Teuscher, C. (eds.) From Utopian to Genuine Unconventional Computers, pp. 101\u2013136. Luniver Press, Frome (2006)"},{"key":"6_CR2","unstructured":"Beggs, E. J., Tucker, J.V.: Computations via experiments with kinematic systems, Research Report 4.04, Department of Mathematics, University of Wales Swansea, March 2004 or Technical Report 5-2004, Department of Computer Science, University of Wales Swansea (March 2004)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.amc.2005.09.068","volume":"178","author":"E.J. Beggs","year":"2006","unstructured":"Beggs, E.J., Tucker, J. V.: Embedding infinitely parallel computation in Newtonian kinematics. Applied Mathematics and Computation\u00a0178, 25\u201343 (2006)","journal-title":"Applied Mathematics and Computation"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2006.10.010","volume":"371","author":"E.. J. Beggs","year":"2007","unstructured":"Beggs, E. J., Tucker, J.V.: Can Newtonian systems, bounded in space, time, mass and energy compute all functions? Theoretical Computer Science\u00a0371, 4\u201319 (2007)","journal-title":"Theoretical Computer Science"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1098\/rspa.2007.1835","volume":"463","author":"E.J. Beggs","year":"2007","unstructured":"Beggs, E.J., Tucker, J. V.: Experimental computation of real numbers by Newtonian machines. Proceedings Royal Society Series A\u00a0463, 1541\u20131561 (2007)","journal-title":"Proceedings Royal Society Series A"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Beggs, E.J., Costa, J.F., Loff, B., Tucker, J.V.: Computational complexity with experiments as oracles (in preparation, 2008)","DOI":"10.1098\/rspa.2008.0085"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44881-0_15","volume-title":"Rewriting Techniques and Applications","author":"F. Chen","year":"2003","unstructured":"Chen, F., Rosu, G., Venkatesan, R.P.: Rule-based analysis of dimensional safety. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706. Springer, Heidelberg (2003)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BF01886519","volume":"16","author":"R. Geroch","year":"1986","unstructured":"Geroch, R., Hartle, J.B.: Computability and physical theories. Foundations of Physics\u00a016, 533\u2013550 (1986)","journal-title":"Foundations of Physics"},{"volume-title":"Handbook of Computability Theory","year":"1999","key":"6_CR9","unstructured":"Griffor, E. (ed.): Handbook of Computability Theory. Elsevier, Amsterdam (1999)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E. Fredkin","year":"1982","unstructured":"Fredkin, E., Toffoli, T.: Conservative logic. International Journal of Theoretical Physics\u00a021, 219\u2013253 (1982)","journal-title":"International Journal of Theoretical Physics"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF00484949","volume":"29","author":"G. Kreisel","year":"1974","unstructured":"Kreisel, G.: A notion of mechanistic theory. Synthese\u00a029, 9\u201324 (1974)","journal-title":"Synthese"},{"key":"6_CR12","series-title":"Studies in Logic and the Foundations of mathematics","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of mathematics, vol.\u00a0129. North-Holland, Amsterdam (1989)"},{"key":"6_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics, Perspectives in Mathematical Logic","author":"M.B. Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics, Perspectives in Mathematical Logic. Springer, Berlin (1989)"},{"key":"6_CR14","series-title":"Semantic Modelling","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1093\/oso\/9780198537809.003.0004","volume-title":"Handbook of Logic in Computer Science","author":"V. Stoltenberg-Hansen","year":"1995","unstructured":"Stoltenberg-Hansen, V., Tucker, J.V.: Effective algebras. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science. Semantic Modelling, vol.\u00a0IV, pp. 357\u2013526. Oxford University Press, Oxford (1995)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0049-237X(99)80028-7","volume-title":"Handbook of Computability Theory","author":"V. Stoltenberg-Hansen","year":"1999","unstructured":"Stoltenberg-Hansen, V., Tucker, J.V.: Computable rings and fields. In: Griffor, E.R. (ed.) Handbook of Computability Theory, pp. 363\u2013447. Elsevier, Amsterdam (1999)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(98)00296-5","volume":"219","author":"V. Stoltenberg-Hansen","year":"1999","unstructured":"Stoltenberg-Hansen, V., Tucker, J. V.: Concrete models of computation for topological algebras. Theoretical Computer Science\u00a0219, 347\u2013378 (1999)","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2178\/bsl\/1058448675","volume":"9","author":"V. Stoltenberg-Hansen","year":"2003","unstructured":"Stoltenberg-Hansen, V., Tucker, J. V.: Computable and continuous partial homomorphisms on metric partial algebras. Bulletin for Symbolic Logic\u00a09, 299\u2013334 (2003)","journal-title":"Bulletin for Symbolic Logic"},{"key":"6_CR18","first-page":"317","volume-title":"Handbook of Logic for Computer Science","author":"J.. V. Tucker","year":"2000","unstructured":"Tucker, J. V., Zucker, J.I.: Computable functions and semicomputable sets on many sorted algebras. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic for Computer Science, vol.\u00a0V, pp. 317\u2013523. Oxford University Press, Oxford (2000)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1145\/1024922.1024924","volume":"5","author":"J.. V. Tucker","year":"2004","unstructured":"Tucker, J. V., Zucker, J.I.: Abstract versus concrete computation on metric partial algebras. ACM Transactions on Computational Logic\u00a05, 611\u2013668 (2004)","journal-title":"ACM Transactions on Computational Logic"},{"key":"6_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis, An introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis, An introduction. Springer, Heidelberg (2000)"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/602382.602411","volume":"50","author":"A. Yao","year":"2003","unstructured":"Yao, A.: Classical physics and the Church Turing thesis. Journal ACM\u00a050, 100\u2013105 (2003)","journal-title":"Journal ACM"}],"container-title":["Lecture Notes in Computer Science","Logic and Theory of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69407-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T07:18:16Z","timestamp":1709018296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69407-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540694052","9783540694076"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69407-6_6","relation":{},"subject":[]}}