Natural computation and non-Turing models of computation

Theoretical Computer Science

Volumn 317, Issue 1-3, 2004, Pages 115-145

  MacLennan, Bruce J ^a  

^a University of Tennessee Knoxville   (United States)

Author keywords

Analog computation; Computation on reals; Continuous computation; Natural computation; Turing machine

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER SCIENCE; FORMAL LOGIC; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS;

ANALOG COMPUTATION; COMPUTATION ON REALS; CONTINUOUS COMPUTATIONS; NATURAL COMPUTATIONS;

TURING MACHINES;

EID: 2442610829     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.12.008     Document Type: Conference Paper

References (52)

1. Ballard D.H. An Introduction to Natural Computation. 1997;MIT Press, Cambridge, MA.
2. Blum L., Shub M., Smale S. On a theory of computation and complexity over the real numbers. NP completeness, recursive functions and universal machines Bull. Amer. Math. Soc. 21:1988;1-46.
3. Burgin M. Universal limit Turing machines. Notices Russian Acad. Sci. 325:1992;654-658. (translated from Russian).
4. M. Burgin, Topological algorithms, in: Proc. ISCA 16th Internat Conf.: Computers and their Applications, ISCA, Seattle, 2001, pp. 61-64.
5. B.J. Copeland, The Church-Turing thesis, in: J. Perry, E. Zalta (Eds.), The Stanford Encyclopedia of Philosophy, http://plato.stanford.edu , 1996.
6. Copeland B.J., Sylvan R. Beyond the universal Turing machine. Austral. J. Philos. 77:1999;46-67.
7. Daugman J.G. Spatial visual channels in the Fourier plane. Vision Res. 24:1984;891-910.
8. Daugman J.G. An information-theoretic view of analog representation in striate cortex. Schwartz E.L. Computational Neuroscience. 1985;403-423 MIT Press, Cambridge, MA.
9. Daugman J.G. Uncertainty relation for resolution in space, spatial frequency, and orientation optimized by two-dimensional visual cortical filters. J. Opt. Soc. Amer. A. 2:1985;1160-1169.
10. Daugman J.G. Complete 2-D Gabor transforms by neural networks for image analysis and compression. IEEE Trans. Acoust. Speech Signal Process. 16:1988;1169-1179.
11. Dreyfus H., Dreyfus S. Mind Over Machine. 1986;Macmillan, New York.
12. Harnad S. The symbol grounding problem. Physica D. 42:1990;335-346.
13. Harnad S. Grounding symbols in the analog world. Think. 2:1993;12-78.
14. Hausdorff F. Set Theory. 1957;Chelsea, New York. (transl. J.R. Aumann).
15. MacLennan B.J. Technology-independent design of neurocomputers: the universal field computer. Caudill M., Butler C. Proc. IEEE 1st Internat. Conf. Neural Networks. Vol. 3:1987;39-49 IEEE Press, New York.
16. MacLennan B.J. Logic for the new AI. Fetzer J.H. Aspects of Artificial Intelligence. 1988;163-192 Kluwer, Dordrecht.
17. B.J. MacLennan, Field computation: a theoretical framework for massively parallel analog computation, Parts I-IV, Tech. Report CS-90-100, Department of Computer Science University of Tennessee, Knoxville, 1990. http://www.cs.utk. edu/~mclennan .
18. B.J. MacLennan, Gabor representations of spatiotemporal visual images, Tech. Report CS-91-144, Department of Computer Science, University of Tennessee, Knoxville, 1991. http://www.cs.utk.edu/~mclennan .
19. MacLennan B.J. Characteristics of connectionist knowledge representation. Inform. Sci. 70:1993;119-143. http://www.cs.utk.edu/~mclennan.
20. MacLennan B.J. Field computation in the brain. Pribram K.H. Rethinking Neural Networks: Quantum Fields and Biological Data. 1993;199-232 Lawrence Erlbaum, Hillsdale. http://www.cs.utk.edu/~mclennan.
21. MacLennan B.J. Grounding analog computers. Think. 2:1993;48-51. http://www.cs.utk.edu/~mclennan or cogprints.soton.ac.uk/abs/comp/199906003.
22. MacLennan B.J. Continuous computation and the emergence of the discrete. Pribram K.H. Origins: Brain & Self-Organization. 1994;121-151 Lawrence Erlbaum, Hillsdale. http://www.cs.utk.edu/~mclennan or cogprints.soton.ac.uk/ abs/comp/199906001.
23. MacLennan B.J. Continuous symbol systems: the logic of connectionism. Levine D.S., Aparicio IV M. Neural Networks for Knowledge Representation and Inference. 1994;83-120 Lawrence Erlbaum, Hillsdale. www.cs.utk.edu/~mclennan.
24. MacLennan B.J. Words lie in our way. Minds Mach. 4:1994;421-437. http://www.cs.utk.edu/~mclennan or cogprints.soton.ac.uk/abs/phil/199906001.
25. B.J. MacLennan, Continuous formal systems: a unifying model in language and cognition, in: Proc. IEEE Workshop on Architectures for Semiotic Modeling and Situation Analysis in Large Complex Systems, Monterey, CA, 1995, pp. 161-172. http://www.cs.utk.edu/~mclennan or cogprints.soton.ac.uk/abs/comp/ 199906002.
26. MacLennan B.J. Field computation in motor control. Morasso P.G., Sanguineti V. Self-Organization, Computational Maps and Motor Control. 1997;37-73 Elsevier, Amsterdam. http://www.cs.utk.edu/~mclennan.
27. MacLennan B.J. Field computation in natural and artificial intelligence. Inform. Sci. 119:1999;73-89. http://www.cs.utk.edu/~mclennan.
28. B.J. MacLennan, Can differential equations compute?, Tech. Report UT-CS-01-459, Department of Computer Science, University of Tennessee, Knoxville, 2001. http://www.cs.utk.edu/~mclennan
29. B.J. MacLennan, Continuous information representation and processing in natural and artificial neural networks, Tech. Report UT-CS-03-508, Department of Computer Science, University of Tennessee, Knoxville, 2003. http://www.cs.utk.edu/~mclennan
30. MacLennan B.J. Transcending Turing computability. Minds Mach. 13:2003;3-22. http://www.cs.utk.edu/~mclennan.
31. A.A. Markov, Theory of Algorithms, transl. by J.J. Schorr-Kon, PST Staff, Israel Prog. Sci. Transl. US Department Comm. Ofc. Tech. Service OTS 60-51085, Jerusalem, 1961. (Transl. of Teoriya Algorifmov, Acad. Sci. USSR, Moscow, 1954).
32. A.A. Markov, Theory of Algorithms, transl. by J.J. Schorr-Kon, PST Staff, Israel Prog. Sci. Transl. US Department Comm. Ofc. Tech. Service OTS 60-51085, Jerusalem, 1961. (Transl. of Teoriya Algorifmov, Acad. Sci. USSR, Moscow, 1954).
33. Mead C. Analog VLSI and Neural Systems. 1989;Addison-Wesley, Reading, MA.
34. Mendelson B. Introduction to Topology. 2nd ed. 1990;Dover, New York.
35. Menger K. Dimensionstheorie. 1928;Teubner, Leipzig.
36. Menger K. Topology without points. Rice Inst. Pamphlet. 27:1940;80-107.
37. Milgram A.N. Partially ordered sets, separating systems and inductiveness. Rep. Math. Colloq. Notre Dame Ind. 2nd Ser. 1:1939;18-30.
38. Milgram A.N. Partially ordered sets and topology. Rep. Math. Colloq. Notre Dame, Ind. 2nd Ser. 1:1940;3-9.
39. Milgram A.N. Partially ordered sets and topology. Proc. Natl. Acad. Sci. USA. 26:1940;291-293.
40. Moore C. Recursion theory on the reals and continuous-time computation. Theoret. Comput. Sci. 162:1996;23-44.
41. Moore T.O. Elementary General Topology. 1964;Prentice-Hall, Englewood Cliffs, NJ.
42. Nemytskii V.V., Stepanov V.V. Qualitative Theory of Differential Equations. 1989;Dover, New York.
43. Pour-El M.B. Abstract computability and its relation to the general purpose analog computer (Some connections between logic, differential equations and analog computers). Trans. Amer. Math. Soc. 199:1974;1-29.
44. Roszak T. The Gendered Atom: Reflections on the Sexual Psychology of Science. 1999;Conari Press, Berkeley, CA.
45. Rubel L.A. A universal differential equation. Bull. (NS) Amer. Math. Soc. 4:1981;345-349.
46. Rubel L.A. The extended analog computer. Adv. Appl. Math. 14:1993;39-50.
47. Shannon C.E. Mathematical theory of the differential analyzer. J. Math. Phys. MIT. 20:1941;337-354.
48. Shepard R.N. Form, formation, and transformation of internal representations. Solso R.L. Information Processing in Cognition: The Loyola Symposium. 1975;Lawrence Erlbaum, Hillsdale.
49. Shepard R.N., Metzler J. Mental rotation of three-dimensional objects. Science. 171:1971;701-703.
50. Stone M.H. The theory of representation for Boolean algebras. Trans. Amer. Math. Soc. 40:1936;37-111.
51. Stone M.H. Applications of the theory of Boolean rings to general topology. Trans. Amer. Math. Soc. 41:1937;375-481.
52. Wallman H. Lattices and topological spaces. Ann. Math. (Ser. 2). 39:1938;112-126.