Knowledge, Understanding, and Computational Complexity

Optimality in Biological and Artificial Networks?

Volumn , Issue , 2013, Pages 125-144

  Parberry, Ian ^a  

^a Center for Advanced Research and Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17044390526     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4324/9780203773833-15     Document Type: Chapter

References (46)

1. Adleman, L. (1978). Two theorems on random polynomial time. In 19lh Annual Symposium on Foundations of Computer Science (pp. 75-83). IEEE Computer Society Press.
2. Barrow, J. D., and Tipler, F. J. (1986). The Anlhropic Cosmological Principle. Oxford, UK: Clarendon Press.
3. Bell, G. (1989). The future of high performance computers in science and engineering. Communications of the ACM, 32, 1091-1101.
4. Campbell, J. (1989). The Improbable Machine. New York: Simon and Schuster.
5. Churchland, P. M., and Churchland, P. S. (1990). Could a machine think? Scientific American, 262, 32-37.
6. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990). Introduction to Algorithms. Cambridge, MA: MIT Press.
7. DARPA Neural Network Study (1988). Alexandria, VA: AFCEA International Press, 1988.
8. Dumont, J. P. C, and Robertson, R. M. (1986). Neuronal circuits: An evolutionary perspective. Science, 233, 849-853.
9. Dymond, P. W. (1980). Simultaneous resource bounds and parallel computations. Doctoral dissertation (Tech. Rep. #TR145). Department of Computer Science, University of Toronto.
10. Dymond, P. W., and Cook, S. A. (1980). Hardware complexity and parallel computation. In 21st Annual Symposium on Foundations of Computer Science (pp. 360-372). IEEE Computer Society Press, 1980.
11. Emiliani, C. (1988). The Scientific Companion. New York: John Wiley and Sons.
12. Garey, M. R., and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman.
13. Goldschlager, L. M. (1977). Synchronous parallel computation. Doctoral dissertation (Tech. Rep. # TRI 14), Department of Computer Science, University of Toronto.
14. Goldschlager, L. M. (1982). A universal interconnection pattern for parallel computers. Journal of the ACM, 29, 1073-1086.
15. Goldschlager, L. M., and Lister, A. M. (1983). Computer Science: A Modern Introduction. Englewood Cliffs, NJ: Prentice-Hall.
16. Hartmanis, J., and Stearns, R. E. (1965). On the computational complexity of algorithms. Transactions of the American Mathematical Society, 117, 285-306.
17. Langendoen, D. T., and Postal, P. M. (1984). The Vaslness of Natural Languages. Basil Blackwell.
18. Li, M., and Vitanyl, P. M. B. (1989). A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution. In 30lh Annual Symposium on Foundations of Computer Science (pp. 34-39). IEEE Computer Society Press.
19. Maass, W., Schnitger, G., and Sontag, E. D. (1991). On the computational power of sigmoid versus Boolean threshold circuits. In 32nd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press.
20. Miller, G. A. (1956). The magic number seven, plus or minus two: Some limits on our capacity for processing information. Psychological Review, 63.
21. Natarajan, B. K. (1991). Machine Learning: A Theoretical Approach. San Mateo, CA: Morgan Kaufmann.
22. Obradovic, Z., and Parberry, I. (1990a). Analog neural networks of limited precision I: Computing with multilinear threshold functions. In Advances in Neural Information Processing Systems 2 (pp. 702-709). San Mateo, CA: Morgan Kaufmann.
23. Obradovic, Z., and Parberry, I. (1990b). Learning with discrete multi-valued neurons. Proceedings of the Seventh Annual Machine Learning Conference (pp. 392-399).
24. Parberry, I. (1987). Parallel Complexity Theory. Research Notes in Theoretical Computer Science. London: Pitman.
25. Parberry, I. (1990). A primer on the complexity theory of neural networks. In R. Banerji (Ed.), Formal Techniques in Artificial Intelligence: A Sourcebook, Volume 6 of Studies in Computer Science and Artificial Intelligence, pp. 217-268. Amsterdam: North-Holland.
26. Parberry, I. (1992). Circuit complexity and neural networks. In P. Smolensky, M. Mozer, and D. Rumelhart (Eds.), Mathematical Perspectives on Neural Networks, Developments in Connectionist Theory. Hillsdale, NJ: Lawrence Erlbaum Associates.
27. Parberry, I. (1994). Circuit Complexity in Neural Networks. Cambridge, MA: MIT Press.
28. Parberry, I., and Schnitger, G. (1988). Parallel computation with threshold functions. Journal of Computer and System Sciences, 36, 278-302.
29. Parberry, I., and Schnitger, G. (1989). Relating Boltzmann machines to conventional models of computation. Neural Networks, 2, 59-67.
30. Penrose, R. (1989). The Emperor’s New Mind. Oxford: Oxford University Press.
31. Pribram, K. H., and McGuinness, D. (1992). Attentional and para-attentional processing: Event-related brain potentials as tests of a model. In D. Friedman and G. Bruder (Eds.), Annals of the New York Academy of Sciences, 658, 65-92.
32. Rockell, A. J., Hiorns, R. W., and Powell, T. P. S. (1980). The basic uniformity in structure of the neocortex. Brain, 103, 221-244.
33. Rumelhart, D. E., Hinton, G. E., and McClelland, J. L. (1986). A general framework for parallel distributed processing. In D. E. Rumelhart and J. L. McClelland (Eds.), Parallel Distributed Processing: Explorations in the Microslructure of Cognition (Vol. 1, pp. 282-317). Cambridge, MA: MIT Press, 1986.
34. Schank, R., and Abelson, R. (1977). Scripts, Plans, Coals and Understanding. Hillsdale, NJ: Lawrence Erlbaum Associates.
35. Searle, J. R. (1979a). The intentionality of intention and action. Inquiry, 22, 253-280.
36. Searle, J. R. (1979b). What is an intentional state? Mind, 88, 74-92.
37. Searle, J. R. (1980). Minds, brains and programs. The Behavioral and Brain Sciences, 3, 417-457.
38. Searle, J. R. (1984). Minds, Brains and Science. Cambridge, MA: Harvard University Press.
39. Searle, J. R. (1990). Is the brain’s mind a computer program? Scientific American, 262, 26-31, 1990.
40. Shepherd, G. M. (1988). Neurobiology. New York: Oxford University Press.
41. Simon, H. (1979). A behavioral model of rational choice (1955). In H. Simon (Ed.), Models of Thought (pp. 7-19). New Haven: Yale University Press.
42. Stork, D. G. (1992). Preadaptation and principles of organization in organisms. In A. Baskin and J. Mittenthal (Eds.), Principles of Organization in Organisms (pp. 205-224). Addison-Wesley, Santa Fe Institute.
43. Stork, D. G., Jackson, B., and Walker, S. (1991). “Non-optimality” via preadaptation in simple neural systems. In C. G. Langton, C. Taylor, J. D. Farmer, and S. Rasmussen (Eds.), Artificial Life II (pp. 409-429). Addison-Wesley, Santa Fe Institute.
44. Turing, A. M. (1950). Computing machinery and intelligence. Mind, 59, 433-460.
45. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 21, 1134-1142.
46. Whitehead, A. N., and Russell, B. A. W. (1910-1913). Principia Mathematica. Cambridge, UK: Cambridge University Press.