Bio-steps beyond Turing

BioSystems

Volumn 77, Issue 1-3, 2004, Pages 175-194

  Calude, Cristian S ^a   Pǎun, Gheorghe ^b,c  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b INSTITUTE OF MATHEMATICS   (Romania)

^c UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Bio steps; P systems; Turing

Indexed keywords

BIOLOGY;

ACCELERATION; ARTICLE; ARTIFICIAL INTELLIGENCE; COMPUTER INTERFACE; COMPUTER LANGUAGE; COMPUTER PROGRAM; COMPUTER SYSTEM; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MOLECULAR COMPUTER;

EID: 7544225811     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.biosystems.2004.05.032     Document Type: Article

References (65)

1. Adamyan, V.A., Calude, C.S., Pavlov, B.S., 2004. Transcending the limits of Turing computability. In: Hida, T. (Ed.), Proceedings of Winter School, Meijo University, Japan, World Scientific, Singapore, to appear.
2. Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P., 2002. Molecular Biology of the Cell, fourth ed. Garland Science, New York.
3. Ardelean I.I. The relevance of cell membrane for P systems. General aspects. Fundam. Informat. 49(1-3):2002;35-43
4. Bennett C.H., Gardner M. The random number omega bids fair to hold the mysteries of the universe. Sci. Am. 241:1979;20-34
5. Bernardini, F., Gheorghe, M., 2003. On the power of minimal symport/antiport. In: Pre-proceedings of Workshop on Membrane Computing, WMC2003, Tarragona, GRLMC Report 28/03. Rovira i Virgili Univ., Tarragona 72-83.
6. Bernardini, F., Pǎun, A., Universality of minimal symport/antiport: five membranes suffice, in Martín-Vide et al. (2003), pp. 43-54.
7. Blake R.M. The paradoxes of temporal process. J. Philos. 23:1926;645-654
8. Calude, C.S., 2002. Information and Randomness: An Algorithmic Perspective, second ed., Revised and Extended. Springer-Verlag, Berlin.
9. Calude, C.S., Casti, J.L., 1998. Parallel thinking. Nature, 392 (9), 549-551.
10. Calude C.S., Dinneen M.J., Svozil K. Reflections on quantum computing. Complexity. 6(1):2002;35-37
11. Calude, C.S., Jürgensen, H., Legg, S., 2000. Solving finitely refutable mathematical problems. In: Calude, C.S., Pǎun Gh. (Eds.), Finite Versus Infinite. Contributions to an Eternal Dilemma. Springer-Verlag, London, pp. 39-52.
12. Calude, C.S., Pǎun, Gh., 2001. Computing with Cells and Atoms. Taylor and Francis Publishers, London.
13. Calude C.S., Pavlov B. Coins, quantum measurements, and Turing's barrier. Quantum Inform. Process. 1(1-2):2002;107-127
14. Casti J.L. Computing the uncomputable. The New Scientist. 154(17):1997;34
15. Casti, J.L., 2003. The One True Platonic Haven, Joseph Henry Press, New York.
16. Chaitin G.J. A theory of program size formally identical to information theory. J. Assoc. Comput. Mach. 22:1975;329-340
17. Chaitin, G.J., 1987. Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987 (third printing 1990).
18. Chaitin, G.J., 2001. Exploring Randomness. Springer-Verlag, London.
19. Chown, M., 2003. Personal communication to C. Calude, 18 November.
20. Chown, M., 2002. Smash and grab (Feature Story), New Scientist, 6 April, 24-28.
21. Copeland, B.J., 1998. Even Turing machines can compute uncomputable functions. In: Calude, C.S., Casti, J., Dinneen, M.J. (Eds.). Unconventional Models of Computation. Springer-Verlag, Singapore, pp. 150-164.
22. Copeland, B.J. (Ed.). 2002. Minds Machines, 12, 4 (2002), and 13, 1 (2003).
23. Copeland B.J. Hypercomputation. Minds Machines. 12(4):2002;461-502
24. Davis, M., 2004. The myth of hypercomputation, in Teuscher (2003), pp. 195-211.
25. Delahaye J.-P. La barrière de Turing. Pour la Science. 312:2003;90-95
26. Etesi G., Németi I. Non-Turing computations via Malament-Hogarth space-times. Int. J. Theor. Phys. 41:2002;341-370
27. Frisco, P., Hoogeboom, H.J., 2004. Simulating counter automata with P systems with symport/antiport, in Paun et al. (2002), pp. 288-301.
28. Hameroff S., Penrose R. Consciousness events as orchestrated space-time selections. J. Conscious. Stud. 2:1966;36-53
29. Hoffmeyer J. Surfaces inside surfaces. On the origins of agency and life. Cybern. Hum. Knowing. 5(1):1998;33-42
30. http://www.psystems.disco.unimib.it.
31. http://www.hypercomputation.net/bib.
32. Ibarra, O.H., 2004. The number of membranes matters, in Martín-Vide et al. (2003), pp. 217-230.
33. Ibarra, O.H., in press. On the computational complexity of membrane computing systems, Theor. Comput. Sci., in press.
34. Ito, M., Martín-Vide, C., Pǎun, Gh., 2001. A characterization of Parikh Sets of ET0L languages in terms of P systems. In: Ito, M., Pǎun, Gh., Yu, S. (Eds.). Words, Semigroups, and Transducers, World Scientific, Singapore, pp. 239-254.
35. Kauffman, S., 1993. The Origin of Order. Oxford University Press, Oxford.
36. Khanna, T., 1990. Foundations of Neural Networks, Addison-Wesley, New York.
37. Kieu, T.D., 2001. Quantum algorithm for the Hilbert's tenth problem, Los Alamos preprint archive http://arXiv:quant-ph/0110136,v2
38. Kieu T.D. Quantum hypercomputation. Minds Machines. 12(4):2002;541-561
39. Loewenstein, W.R., The Touchstone of Life. Molecular Information, Cell Communication, and the Foundations of Life. Oxford University Press, New York, Oxford.
40. Madhu, M., Krithivasan, K., 2001. P systems with membrane creation: Universality and efficiency. In: Margenstern, M., Rogozhin, Y. (Eds.), Proceedings of the Third International Conference on Universal Machines and Computations, Chişinau, Moldova, 2001, Lecture Notes in Computer Science, 2055. Springer-Verlag, Berlin, pp. 276-287.
41. Marcus, S., Bridging P systems and genomics: a preliminary approach, in Pǎun et al. (2002), pp. 371-376.
42. Marshall I.N. Consciousness and Bose-Einstein condensates. New Ideas Psychol. 7:1989;73-83
43. Martín-Vide, C., Pǎun, Gh., Rozenberg, G., Salomaa, A. (Eds.). 2003. Membrane Computing. International Workshop, WMC 2003, Tarragona, Spain, Revised Papers, Lecture Notes in Computer Science, 2933. Springer-Verlag, Berlin.
44. Minsky, M., 1967. Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, NJ.
45. Ord, T., 2002. Hypercomputation: Computing more than the Turing Machine. Honours Thesis, Computer Science Department, University of Melbourne, Australia, 2002;arxiv.org/ftp/math/papers/0209/0209332.pdf.
46. Ord T., Kieu T.D. On the existence of a new family of Diophantine equations for. Ω Fundam. Informat. 56(3):2003;273-284
47. Paun Gh. Computing by carving. Soft Comput. 3(1):1999;30-36
48. Paun Gh. Computing with membranes. J. Comput. Syst. Sci. 61(1):2000;108-143
49. Pǎun, Gh., 2002. Computing with Membranes: An Introduction. Springer-Verlag, Berlin.
50. Paun Gh., Rozenberg G. A guide to membrane computing. Theor. Comput. Sci. 287(1):2002;73-100
51. Pǎun, Gh., Rozenberg, G., Salomaa, A., Zandron, C. (Eds.). 2002. Membrane Computing. International Workshop, WMC 2002, Curtea de Argeş, Romania, Revised Papers, Lecture Notes in Computer Science, 2597. Springer-Verlag, Berlin.
52. Penrose, R., 1989. The Emperor's New Mind. Concerning Computers, Minds, and the Laws of Physics. Oxford University Press, Oxford.
53. Penrose R. Précis of The Emperor's New Mind. Concerning Computers, Minds, and the Laws of Physics (together with responses by critics and a reply by the author). Behav. Brain Sci. 13:1990;643-705
54. Penrose, R., 1994. Shadows of the Mind. Oxford University Press, Oxford.
55. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F., 2002. Teoría de la Complejidad en Modelos de Computatión Celular con Membranas, Editorial Kronos, Sevilla.
56. Russell B.A.W. The limits of empiricism. Proc. Aristotelian Soc. 36:1936;131-150
57. Salomaa, A., 1973. Formal Languages. Academic Press, New York.
58. Siegelmann H.T. Computation beyond the Turing limit. Science. 268:1995;545-548
59. Siegelmann H.T. Neural and super-Turing computing. Minds Machines. 13(1):2003;103-114
60. Stewart I. Deciding the undecidable. Nature. 352:1991;664-665
61. Svozil, K., 1998. The Church-Turing Thesis as a guiding principle for physics. In: Calude, C.S., Casti, J., Dinneen. M.J. (Eds.). Unconventional Models of Computation. Springer-Verlag, Singapore, pp. 371-385.
62. Teuscher C., Sipper M. Hypercomputation: Hyper or computation? Communications ACM. 45(8):2002;23-24
63. Teuscher, C. (Ed.). 2003. Alan Turing: Life and Legacy of a Great Thinker. Springer-Verlag, Heidelberg.
64. Weyl, H., 1927. Philosophie der Mathematik und Natureissenschaft, R. Oldenburg, Munich.
65. Wiedermann, J., van Leeuwen, J., Relativistic computers and non-uniform complexity theory. In: Calude, C.S., Dinneen, M.J., Peper, F. (Eds.). Unconventional Models of Computation (UMC'02). Lecture Notes Comput. Sci. 2509. Springer-Verlag, Berlin, pp. 287-299.