Non-classical hypercomputation

International Journal of Unconventional Computing

Volumn 5, Issue 3-4, 2009, Pages 267-276

  Stepney, Susan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Analog computing; Bio inspired computing; Grand challenges; Quantum computing

Indexed keywords

EID: 77952471105     PISSN: 15487199     EISSN: 15487202     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. D.S. Abrams and S. Lloyd. Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems. Phys. Rev. Lett. 81 (1998), 3992-3995.
2. P. W. Anderson. More is different. Science 177 (1972), 293-296.
3. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70 (1993), 1895-1899.
4. A. Cabello. Communication complexity as a principle of quantum mechanics. In C. S. Calude, M. J. Dinneen, G. Pǎun, M. J. Pérez-Jiménez, and G. Rozenberg, editors, Unconventional Computation 2005, Volume 3699 of LNCS, Springer, 2005, pp. 70-81.
5. A. R. Calderbank and P. W. Shor. Good quantum error-correcting codes exist. Phys. Rev, A. 54(2) (1996),1098-1105.
6. A. Clark. Being There: Putting Brain, Body and World Together Again. Oxford University Press, 1997.
7. J. A. Clark, S. Stepney and H. Chivers. Breaking the model: finalisation and a taxonomy of security attacks. In Derrick and Boiten [8], 2005, pp. 225-242.
8. J. Derrick and E. Boiten, editors. REFINE 2005 Workshop, Guildford, UK, April 2005 Volume 137(2) of ENTCS. Elsevier, 2005.
9. D. Deutsch. The Fabric of Reality. Penguin, 1997.
10. GC in Non-Classical Computation website. Online: http://www.cs.york.ac.uk/nature/gc7/.
11. He J., C. A. R. Hoare and J. W. Sanders. Data refinement refined (resumé). In ESOP'89, Volume 213 of LNCS, Springer, 1986, pp. 187-196.
12. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
13. M. Hogarth. Does general relativity allow an observer to view an eternity in a finite time? Foundations of Physics Letters 5 (1992), 73-81.
14. J. L. Jacob. Basic theorems about security. J. Computer Security 1 (1992), 385-411.
15. J. A. S. Kelso. Dynamic Patterns: the self-organization of brain and behavior. MIT Press, 1995.
16. J. Kempe. Quantum random walks: an introductory overview. Contemporary Physics 44(4) (2003),307-327.
17. P. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Crypto '96, Volume 1109 of LNCS, Springer, 1996, pp. 319-330.
18. P. Kocher, J. Jaffe, and B. Jun. Differential power analysis. In Crypto '96, Volume 1666 of LNCS, Springer, 1999, pp. 388-397.
19. R. Landauer. Irreversibility and heat generation in the computing process. IBM Journal of Research and Development 5(3) (1961), 183-191.
20. B. J. MacLennan. Transcending Turing computability. Minds and Machines 13(1) (2003), 3-22.
21. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS, Springer, 1980.
22. R. Milner, J. Parrow and D. Walker. A calculus of mobile processes. Information and Computation 100(1) (1992), 1-77.
23. F. Polack and S. Stepney. Emergent properties do not refine. In Derrick and Boiten [8], pp. 163-181, 2005.
24. Quantum random number download website. Online: http://www.randomnumbers.info/.
25. T. L. V. L. Santos, A. L. C. Cavalcanti and A.C.A. Sampaio. Object orientation in the UTP. In S. Dunne and B. Stoddart, editors, Unifying Theories of Programming, volume 4010 of LNCS, Springer, 2006, pp. 18-37.
26. P. W. Shor. Polynomial-time algorithms for prime number factorization and discrete logarithms on a quantum computer. SIAM J. Comp. 26(5) (1997), 1484-1509.
27. A. Sloman. The irrelevance of Turing Machines to AI. In M. Scheutz, editor, Computationalism: New Directions, MIT Press, 2002, pp. 87-127.
28. S. Stepney. Embodiment. In D. Flower and J. Timmis, editors, In Silico Immunology, Chapter 12, Springer, 2007, pp. 265-288.
29. S. Stepney, S. L. Braunstein, J. A. Clark, A. Tyrrell, A. Adamatzky, R. E. Smith, T. Addis, C. Johnson, J. Timmis, P. Welch, R. Milner and D. Partridge. Journeys in non-classical computation I: A grand challenge for computing research. Int. J. Parallel, Emergent and Distributed Systems 20(1) (2005), 5-19.
30. S. Stepney, S. L. Braunstein, J. A. Clark, A. Tyrrell, A. Adamatzky, R. E. Smith, T. Addis, C. Johnson, J. Timmis, P. Welch, R. Milner and D. Partridge. Journeys in non-classical computation II: Initial journeys and waypoints. Int. J. Parallel, Emergent and Distributed Systems 21(2) (2006), 97-125.
31. S. Stepney, D. Cooper, and J. Woodcock. More powerful Z data refinement: pushing the state of the art in industrial refinement. In J. P. Bowen, A. Fett and M. G. Hinchey, editors, 11th International Conference of Z Users, Berlin, Germany, September 1998, volume 1493 of LNCS, Springer, 1998, pp. 284-307.
32. UKCRC Grand Challenge website. Online: http://www.ukcrc.org.uk/grand_challenges/index.cfm.
33. P. Wegner. Why interaction is more powerful than algorithms. Comms. ACM 40(5) (1997), 81-91.
34. J. A. Wheeler. Information, physics, quantum: The search for links. In W. H. Zurek, editor, Complexity, Entropy and the Physics of Information, Addison, Wesley, 1990, pp. 3-28.
35. J. Woodcock, S. Stepney, D. Cooper, J. A. Clark and J. L. Jacob. The certification of the Mondex electronic purse to ITSEC Level E6. Formal Aspects of Computing 20(1) (2008), 5-19.
36. J. C. P. Woodcock and A. L. C. Cavalcanti. The semantics of Circus. In D. Bert, J. P. Bowen, M. C. Henson and K. Robinson, editors, ZB 2002, volume 2272 of LNCS, Springer, 2002, pp. 184-203.
37. W. K. Wootters and W. H. Zurek. A single quantum cannot be cloned. Nature 299 (1982), 802-803.