Are there new models of computation? Reply to Wegner and Eberbach

Computer Journal

Volumn 50, Issue 2, 2007, Pages 232-247

  Cockshott, Paul ^a   Michaelson, Greg ^b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Computability; Effective calculability; Hyper computation

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; TURING MACHINES;

CALCULUS; HYPER-COMPUTATION;

COMPUTATION THEORY;

EID: 33947204662     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxl062     Document Type: Article

References (59)

1. Turing, A.M. (1936) On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc., 42, 230-265.
2. Kuhn, T. (1970) The Structure of Scientific Revolutions. University of Chicago Press, Chicago.
3. Ekdahl, B. (1999) Interactive computing does not supersede Church's thesis. Proc. Computer Science, 17th Int. Conf., San Diego, pp. 261-265. Association of Management and the International Association of Management.
4. Church, A. (1936) An unsolvable problem of elementary number theory. Am. J. Math., 58, 345-363.
5. Kleene, S.C. (1935) General recursive functions of natural numbers. Am. J. Math., 57, 727-742.
6. Turing, A.M. (1939) Systems of logic based on the ordinals. Proc. Lond. Math. Soc., 45, 161-228.
7. Turing, A.M. (1950) Computing machinery and intelligence. Mind, LIX, 433-460.
8. Hayes, I. and Jones, C. (1989) Specifications are not (necessarily) executable. Softw. Eng. J., 4, 330-338.
9. Davis, M. (1958) Computability and Undecidability. McGraw-Hill, New York.
10. Cook, S. (1971) The complexity of theorem proving procedures. Proc. Third Annual ACM Symposium on Theory of Computing, May, p. 151-158. ACM.
11. Althusser, L. and Balibar, É. (1970) Reading Capital. New Left Books, London.
12. Lassegue, J. (2002) Turing, entre formel et forme; remarques sur la convergence des perspectives morphologiques. Intellectica, 2002/2, 185-198.
13. Hussey, E. (ed.) (1983) Aristotle's Physics. Clarendon, Oxford.
14. Copeland, J. (2002) Accelerated Turing machines. Minds Mach., 12, 281-301.
15. Hamkins, J.D. (2002) Infinite time Turing machines. Minds Mach., 12, 521-539.
16. Copeland, J. and Sylvan, R. (1999) Beyond the universal Turing machine. Aust. J. Phil., 77, 46-66.
17. Bournez, O. and Cosnard, M. (1995) On the computational power and super-Turing capabilities of dynamical systems. Technical Report 95-30, Ecole Normale Supérieure de Lyon.
18. Koiran, P. and Moore, C. (1999) Closed-form analytic maps in one and two dimensions can simulate Turing machines. Theoret. Comput. Sci., 210, 217-223.
19. Turing, A.M. (2004) Lecture on the automatic computing engine, 1947. In Copeland, B.J. (ed.), The Essential Turing. OUP, Oxford.
20. Hodges, A. (1983) Alan Turing the Enigma. Touchstone, New York.
21. Landauer, R. (1961) Irreversibility and heat generation in the computing process. IBM J. Res. Dev., 5, 183-191.
22. Landauer, R. (1992) Information is physical. PhysComp'92, Workshop on Physics and Computation, 2-4 October 1992, pp. 1-4. IEE Press, Dallas, Texas.
23. Deutsch, D. (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond. A, 400, 97-117.
24. Feynman, R.P. (2002) There's plenty of room at the bottom. In Hey, A. (ed.), Feynman and Computing. Westview Press, Oxford.
25. Feynman, R.P. (1999) Simulating physics with computers. In Hey, A. (ed.), Feynman and Computation: Exploring the Limits of Computers, pp. 133-153. Perseus Books, Boulder, Colorado.
26. Kieu, T.D. (2003) Quantum algorithm for Hilbert's tenth problem. Int. J. Theoret. Phys., 42, 1461-1478.
27. Smith, W.D. (2006) Three counterexamples refuting Kieu's plan for 'quantum adiabatic hypercomputation' and some uncomputable quantum mechanical tasks. J. Appl. Math. Comput., 187, 184-193.
28. Hodges, A. (2005) Can quantum computing solve classically unsolvable problems? Technical Report quant-ph/0512248, arXiv.org.
29. Davis, M. (2006) The Church-Turing thesis: Consensus and opposition. In Beckmann, A., Berger, U., Lowe, B. and Tucker, J.V. (eds), Logical Approaches to Computational Barriers: Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June/July, pp. 125-132. 3988, LNCS, Springer, Guildford.
30. Kieu, T.D. (2006) Reply to Andrew Hodges. Technical Report quant-ph/0602214, arXiv.org.
31. Kieu, T.D. (2006) On the identification of the ground state based on occupation probabilities. Technical Report quant-ph/0602145, arXiv.org.
32. Adamyan, V., Calude, C. and Pavlov, B. (2003) Transcending the limits of Turing computability. Arxiv preprint quant-ph/034128.
33. Calude, C. and Pavlov, B. (2002) Coins, quantum measurements, and Turing's barrier. Quantum Inf. Process., 1, 107-127.
34. Wegner, P. and Eberbach, E. (2004) New models of computation. Comput. J., 47, 4-9.
35. Goldin, D., Smolka, S., Attie, P. and Sonderegger, E. (2004) Turing machines, transition systems, and interaction. Inf. Comput., 194, 101-128.
36. Wegner, P. (1997) Why interaction is more powerful than algorithms. Commun. ACM, 40, 80-91.
37. Cockshott, P., Atkinson, M., Chisholm, K., Bailey, P. and Morrison, R. (1984) POMS-a persistent object management system. Softw. Pract. Exp., 14, 49-71.
38. Cockshott, P. (1982) Orthogonal persistence. Ph.D. thesis, Department of Computer Science, University of Edinburgh.
39. Chaitin, G. (1987) Information, Randomness and Incompleteness. World Scientific, Singapore.
40. Turner, D. and Pierce, B. (2000) Piet: A programming language based on the π-calculus. In Plotkin, G., Stirling, C. and Tofte, M. (eds), Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 455-494. MIT Press, Cambridge, MA.
41. Milner, R. (1993) Elements of interaction: Turing award lecture. Commun. ACM, 36, 78-89.
42. Einstein, A. (1920) Relativity. Methuen and Company, London.
43. Bracha, G. and Toueg, S. (1983) Asynchronous consensus and byzantine protocol in a faulty environment. Technical Report TR-83-559, CS Department Cornell University, Ithaca, NY.
44. Sangiori, D. and Walker, D. (2001) The π-calculus. Cambridge University Press, Cambridge.
45. Yarmolenko, V., Cockshott, P., Borland, E. and Mackenzie, L. (2004) Jπ INTERFACE: A Java implementation of the π-calculus for grid computing. Proceedings of 2nd International Workshop on Middleware for Grid Computing, Toronto, Ontario-Canada, 18 October 2004.
46. Walker, D. and Dongarra, J. (1996) MPI: A standard message passing interface. Supercomputer, 12, 56-68.
47. Ferrari, A. (1998) JPVM: Network parallel computing in Java. Concurrency-Pract. Exp., 10, 985-992.
48. Beguelin, A., Dongarra, J., Jiang, W., Manchek, R. and Sunderam, V. (1995) PVM: Parallel Virtual Machine: A Users' Guide and Tutorial for Networked Parallel Computing. MIT Press Cambridge, MA.
49. Gray, P. and Sunderam, V. (1997) IceT: Distributed computing and Java. Concurrency - Pract. Exp., 9, 1161-1167.
50. Garzon, M. (1995) Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks. EATCS, Springer-Verlag, London.
51. Eberbach, E. (2000) Expressiveness of $-calculus: What matters? In Klopotek, M., Michalewicz, M. and Wierzchon, S.T. (eds), Advances in Soft Computing, pp. 145-157. Physica-Verlag, Heidelberg.
52. Eberbach, E. (2001) $-calculus bounded rationality = process algebra + anytime algorithms. In Misra, J. C. (ed.), Applicable Mathematics: Its Perspectives and Challenges, pp. 213-220. Narosa Publishing House, New Delhi.
53. Eberbach, E. (2002) On expressiveness of evolutionary computation: Is EC algorithmic? Proc. 2002 World Congress on Computational Intelligence WCCI'2002, Honolulu, HI, 2002, pp. 564-569
54. Milner, R. (1992) The polyadic π-calculus: A tutorial. In Bauer, F.L. and Brauer, W. (eds), Logic and Algebra of Specification. Springer-Verlag, Berlin.
55. Wegner, P. (1997) Interactive software technology. In Tucker, A.B. (ed.), The Computer Science and Engineering Handbook. CRC Press, Boca Raton.
56. Post, E.L. (1936) Finite combinatory processes. Formulation 1. J. Symbolic Logic, 1, 103-105.
57. Davis, M. (1965) The Undecidable. Raven Press, New York.
58. Kleene, S. (1952) Introduction to Metamathematics. North-Holland, Amsterdam.
59. Davis, M. (1958) Computability and Unsolvability. McGraw-Hill, New York.