Skip to main content
Log in

On limits to perception and pattern recognition

  • Published:
Bulletin of Mathematical Biology Aims and scope Submit manuscript

Abstract

We propose certain general conditions that we believe are reasonable for any pattern recognition algorithm. We find that these conditions give rise to paradoxical identification. The algorithms are incapable of distinguishing composite patterns and must be able to distinguish patterns at an atomistic level.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature

  • Arrow, K. J. 1963.Social Choice and Individual Values. New York: Wiley.

    Google Scholar 

  • Diogenes, Laertius. 1925.Lives of Eminent Philosophers vii, 82. Harvard University Press.

  • Domany, E., R. Meir and W. Kinzel. 1986.Europhys. Lett. 2, 175.

    Google Scholar 

  • Hopfield, J. J. 1982.Proc. natl Acad. Sci. U.S.A. 79, 2554.

    Article  MathSciNet  Google Scholar 

  • Kelly, J. S. 1978.Arrow Impossibility Theorems. AP.

  • Minsky, M. L. and S. Papert. 1969.Perceptrons. Cambridge, MA: MIT.

    Google Scholar 

  • Rosenblatt, F. 1961.Principles of Neurodynamics. Washington DC: Spartan.

    Google Scholar 

  • Rumelhart, P. E., G. E. Hinton and R. J. Williams. 1986.Nature 323, 533–536.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thompson, C.J., McGuire, J.B. On limits to perception and pattern recognition. Bltn Mathcal Biology 51, 681–686 (1989). https://doi.org/10.1007/BF02459655

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02459655

Keywords

Navigation