{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T09:20:22Z","timestamp":1713864022294},"reference-count":59,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,3,1]]},"DOI":"10.1093\/comjnl\/bxl062","type":"journal-article","created":{"date-parts":[[2007,2,3]],"date-time":"2007-02-03T06:47:37Z","timestamp":1170485257000},"page":"232-247","source":"Crossref","is-referenced-by-count":12,"title":["Are There New Models of Computation? Reply to Wegner and Eberbach \u2020"],"prefix":"10.1093","volume":"50","author":[{"given":"Paul","family":"Cockshott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greg","family":"Michaelson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2007,2,1]]},"reference":[{"key":"key\n\t\t\t\t20171013013827_BXL062C1","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. Lond. Math. Soc."},{"key":"key\n\t\t\t\t20171013013827_BXL062C2","volume-title":"The Structure of Scientific Revolutions","author":"Kuhn","year":"1970"},{"key":"key\n\t\t\t\t20171013013827_BXL062C3","first-page":"261","article-title":"Interactive computing does not supersede Church's thesis","author":"Ekdahl","year":"1999"},{"key":"key\n\t\t\t\t20171013013827_BXL062C4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2307\/2371045","article-title":"An unsolvable problem of elementary number theory","volume":"58","author":"Church","year":"1936","journal-title":"Am. J. Math."},{"key":"key\n\t\t\t\t20171013013827_BXL062C5","first-page":"727","article-title":"General recursive functions of natural numbers","volume":"57","author":"Kleene","year":"1935","journal-title":"Am. J. Math."},{"key":"key\n\t\t\t\t20171013013827_BXL062C6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s2-45.1.161","article-title":"Systems of logic based on the ordinals","volume":"45","author":"Turing","year":"1939","journal-title":"Proc. Lond. Math. Soc."},{"key":"key\n\t\t\t\t20171013013827_BXL062C7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1093\/mind\/LIX.236.433","article-title":"Computing machinery and intelligence","volume":"LIX","author":"Turing","year":"1950","journal-title":"Mind"},{"key":"key\n\t\t\t\t20171013013827_BXL062C8","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1049\/sej.1989.0045","article-title":"Specifications are not (necessarily) executable","volume":"4","author":"Hayes","year":"1989","journal-title":"Softw. Eng. J."},{"key":"key\n\t\t\t\t20171013013827_BXL062C9","volume-title":"Computability and Undecidability","author":"Davis","year":"1958"},{"key":"key\n\t\t\t\t20171013013827_BXL062C10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem proving procedures","volume-title":"Proc. Third Annual ACM Symposium on Theory of Computing","author":"Cook","year":"1971"},{"key":"key\n\t\t\t\t20171013013827_BXL062C11","volume-title":"Reading Capital","author":"Althusser","year":"1970"},{"key":"key\n\t\t\t\t20171013013827_BXL062C12","first-page":"185","article-title":"Turing, entre formel et forme; remarques sur la convergence des perspectives morphologiques","volume":"2002\/2","author":"Lassegue","year":"2002","journal-title":"Intellectica"},{"key":"key\n\t\t\t\t20171013013827_BXL062C13","volume-title":"Aristotle's Physics","author":"Hussey","year":"1983"},{"key":"key\n\t\t\t\t20171013013827_BXL062C14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1015607401307","article-title":"Accelerated Turing machines","volume":"12","author":"Copeland","year":"2002","journal-title":"Minds Mach."},{"key":"key\n\t\t\t\t20171013013827_BXL062C15","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1023\/A:1021180801870","article-title":"Infinite time Turing machines","volume":"12","author":"Hamkins","year":"2002","journal-title":"Minds Mach."},{"key":"key\n\t\t\t\t20171013013827_BXL062C16","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1080\/00048409912348801","article-title":"Beyond the universal Turing machine","volume":"77","author":"Copeland","year":"1999","journal-title":"Aust. J. Phil."},{"key":"key\n\t\t\t\t20171013013827_BXL062C17","unstructured":"Bournez O. Cosnard M. On the computational power and super-Turing capabilities of dynamical systems 1995 Technical Report 95-30, Ecole Normale Sup\u00e9rieure de Lyon"},{"key":"key\n\t\t\t\t20171013013827_BXL062C18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0304-3975(98)00117-0","article-title":"Closed-form analytic maps in one and two dimensions can simulate Turing machines","volume":"210","author":"Koiran","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"key\n\t\t\t\t20171013013827_BXL062C19","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198250791.003.0015","article-title":"Lecture on the automatic computing engine, 1947","volume-title":"The Essential Turing","author":"Turing","year":"2004"},{"key":"key\n\t\t\t\t20171013013827_BXL062C20","volume-title":"Alan Turing the Enigma","author":"Hodges","year":"1983"},{"key":"key\n\t\t\t\t20171013013827_BXL062C21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","article-title":"Irreversibility and heat generation in the computing process","volume":"5","author":"Landauer","year":"1961","journal-title":"IBM J. Res. Dev."},{"key":"key\n\t\t\t\t20171013013827_BXL062C22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/PHYCMP.1992.615478","article-title":"Information is physical","volume-title":"PhysComp'92, Workshop on Physics and Computation","author":"Landauer","year":"1992"},{"key":"key\n\t\t\t\t20171013013827_BXL062C23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1098\/rspa.1985.0070","article-title":"Quantum theory, the Church-Turing principle and the universal quantum computer","volume":"400","author":"Deutsch","year":"1985","journal-title":"Proc. Roy. Soc. Lond. A"},{"key":"key\n\t\t\t\t20171013013827_BXL062C24","article-title":"There's plenty of room at the bottom","volume-title":"Feynman and Computing","author":"Feynman","year":"2002"},{"key":"key\n\t\t\t\t20171013013827_BXL062C25","first-page":"133","article-title":"Simulating physics with computers","volume-title":"Feynman and Computation: Exploring the Limits of Computers","author":"Feynman","year":"1999"},{"key":"key\n\t\t\t\t20171013013827_BXL062C26","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1023\/A:1025780028846","article-title":"Quantum algorithm for Hilbert's tenth problem","volume":"42","author":"Kieu","year":"2003","journal-title":"Int. J. Theoret. Phys."},{"key":"key\n\t\t\t\t20171013013827_BXL062C27","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.amc.2005.09.078","article-title":"Three counterexamples refuting Kieu's plan for \u2018quantum adiabatic hypercomputation\u2019 and some uncomputable quantum mechanical tasks","volume":"187","author":"Smith","year":"2006","journal-title":"J. Appl. Math. Comput."},{"key":"key\n\t\t\t\t20171013013827_BXL062C28","unstructured":"Hodges A. Can quantum computing solve classically unsolvable problems? 2005 Technical Report quant-ph\/0512248, arXiv.org."},{"key":"key\n\t\t\t\t20171013013827_BXL062C29","first-page":"125","article-title":"The Church\u2013Turing thesis: consensus and opposition","author":"Davis"},{"key":"key\n\t\t\t\t20171013013827_BXL062C30","unstructured":"Kieu T.D. Reply to Andrew Hodges 2006 Technical Report quant-ph\/0602214, arXiv.org."},{"key":"key\n\t\t\t\t20171013013827_BXL062C31","unstructured":"Kieu T.D. On the identification of the ground state based on occupation probabilities 2006 Technical Report quant-ph\/0602145, arXiv.org."},{"key":"key\n\t\t\t\t20171013013827_BXL062C32","volume-title":"Transcending the limits of Turing computability","author":"Adamyan","year":"2003"},{"key":"key\n\t\t\t\t20171013013827_BXL062C33","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1019623616675","article-title":"Coins, quantum measurements, and Turing's barrier","volume":"1","author":"Calude","year":"2002","journal-title":"Quantum Inf. Process."},{"key":"key\n\t\t\t\t20171013013827_BXL062C34","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1093\/comjnl\/47.1.4","article-title":"New models of computation","volume":"47","author":"Wegner","year":"2004","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t20171013013827_BXL062C35","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.ic.2004.07.002","article-title":"Turing machines, transition systems, and interaction","volume":"194","author":"Goldin","year":"2004","journal-title":"Inf. Comput."},{"key":"key\n\t\t\t\t20171013013827_BXL062C36","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/253769.253801","article-title":"Why interaction is more powerful than algorithms","volume":"40","author":"Wegner","year":"1997","journal-title":"Commun. ACM"},{"key":"key\n\t\t\t\t20171013013827_BXL062C37","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/spe.4380140106","article-title":"POMS\u2013a persistent object management system","volume":"14","author":"Cockshott","year":"1984","journal-title":"Softw. Pract. Exp."},{"key":"key\n\t\t\t\t20171013013827_BXL062C38","unstructured":"Cockshott P. Orthogonal persistence 1982 Department of Computer Science, University of Edinburgh Ph.D. thesis"},{"key":"key\n\t\t\t\t20171013013827_BXL062C39","doi-asserted-by":"crossref","DOI":"10.1142\/0531","volume-title":"Information, Randomness and Incompleteness","author":"Chaitin","year":"1987"},{"key":"key\n\t\t\t\t20171013013827_BXL062C40","first-page":"455","article-title":"Pict: A programming language based on the \u03c0-calculus","volume-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","author":"Turner","year":"2000"},{"key":"key\n\t\t\t\t20171013013827_BXL062C41","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/151233.151240","article-title":"Elements of interaction: Turing award lecture","volume":"36","author":"Milner","year":"1993","journal-title":"Commun. ACM"},{"key":"key\n\t\t\t\t20171013013827_BXL062C42","volume-title":"Relativity","author":"Einstein","year":"1920"},{"key":"key\n\t\t\t\t20171013013827_BXL062C43","unstructured":"Bracha G. Toueg S. Asynchronous consensus and byzantine protocol in a faulty environment 1983 Ithaca, NY CS Department Cornell University Technical Report TR-83-559"},{"key":"key\n\t\t\t\t20171013013827_BXL062C44","volume-title":"The \u03c0-calculus","author":"Sangiori","year":"2001"},{"key":"key\n\t\t\t\t20171013013827_BXL062C45","article-title":"J\u03c0 INTERFACE: A Java implementation of the \u03c0-calculus for grid computing","author":"Yarmolenko"},{"key":"key\n\t\t\t\t20171013013827_BXL062C46","first-page":"56","article-title":"MPI: a standard message passing interface","volume":"12","author":"Walker","year":"1996","journal-title":"Supercomputer"},{"key":"key\n\t\t\t\t20171013013827_BXL062C47","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/(SICI)1096-9128(199809\/11)10:11\/13<985::AID-CPE404>3.0.CO;2-A","article-title":"JPVM: network parallel computing in Java","volume":"10","author":"Ferrari","year":"1998","journal-title":"Concurrency\u2013Pract. Exp."},{"key":"key\n\t\t\t\t20171013013827_BXL062C48","volume-title":"PVM: Parallel Virtual Machine: A Users' Guide and Tutorial for Networked Parallel Computing","author":"Beguelin","year":"1995"},{"key":"key\n\t\t\t\t20171013013827_BXL062C49","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1002\/(SICI)1096-9128(199711)9:11<1161::AID-CPE336>3.0.CO;2-E","article-title":"IceT: distributed computing and Java","volume":"9","author":"Gray","year":"1997","journal-title":"Concurrency \u2013 Pract. Exp."},{"key":"key\n\t\t\t\t20171013013827_BXL062C50","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-77905-3","volume-title":"Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks","author":"Garzon","year":"1995"},{"key":"key\n\t\t\t\t20171013013827_BXL062C51","first-page":"145","article-title":"Expressiveness of $-calculus: What matters? In","volume-title":"Advances in Soft Computing","author":"Eberbach","year":"2000"},{"key":"key\n\t\t\t\t20171013013827_BXL062C52","first-page":"213","article-title":"$-calculus bounded rationality = process algebra + anytime algorithms","volume-title":"Applicable Mathematics: Its Perspectives and Challenges","author":"Eberbach","year":"2001"},{"key":"key\n\t\t\t\t20171013013827_BXL062C53","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/CEC.2002.1006988","article-title":"On expressiveness of evolutionary computation: is EC algorithmic?","author":"Eberbach","year":"2002","journal-title":"Proc. 2002 World Congress on Computational Intelligence WCCI'2002"},{"key":"key\n\t\t\t\t20171013013827_BXL062C54","article-title":"The polyadic \u03c0-calculus: a tutorial","volume-title":"Logic and Algebra of Specification","author":"Milner","year":"1992"},{"key":"key\n\t\t\t\t20171013013827_BXL062C55","article-title":"Interactive software technology","volume-title":"The Computer Science and Engineering Handbook","author":"Wegner","year":"1997"},{"key":"key\n\t\t\t\t20171013013827_BXL062C56","doi-asserted-by":"crossref","first-page":"103","DOI":"10.2307\/2269031","article-title":"Finite combinatory processes. Formulation 1","volume":"1","author":"Post","year":"1936","journal-title":"J. Symbolic Logic"},{"key":"key\n\t\t\t\t20171013013827_BXL062C57","volume-title":"The Undecidable","author":"Davis","year":"1965"},{"key":"key\n\t\t\t\t20171013013827_BXL062C58","volume-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"key\n\t\t\t\t20171013013827_BXL062C59","volume-title":"Computability and Unsolvability","author":"Davis","year":"1958"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/50\/2\/232\/7903264\/bxl062.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T16:17:57Z","timestamp":1683735477000},"score":1,"resource":{"primary":{"URL":"http:\/\/academic.oup.com\/comjnl\/article\/50\/2\/232\/2568662\/Are-There-New-Models-of-Computation-Reply-to"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,1]]},"references-count":59,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2007,2,1]]},"published-print":{"date-parts":[[2007,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxl062","relation":{},"ISSN":["1460-2067","0010-4620"],"issn-type":[{"value":"1460-2067","type":"electronic"},{"value":"0010-4620","type":"print"}],"subject":[],"published-other":{"date-parts":[[2007,3]]},"published":{"date-parts":[[2007,2,1]]}}}