Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-05T02:36:10.172Z Has data issue: false hasContentIssue false
  • English
  • Français

The AND/OR Theorem for Perceptrons

Published online by Cambridge University Press:  09 April 2009

I. D. Bruce  and
D. Easdown
I. D. Bruce
Affiliation:
Curtin UniversityGPO Box U1987 Perth WA 6001, Australia
D. Easdown
Affiliation:
University of SydneyNSW 2006, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Minsky and Papert claim that, for any positive integer n, there exist predicates of order 1 whose conjunction and disjunction have order greater than n. Their proof is amended and a stronger result obtained of which their claim is a special case.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 53 , Issue 1 , August 1992 , pp. 1 - 8
Copyright
Copyright © Australian Mathematical Society 1992

References

[1]Marsden, Jerrold E., Elementary Classical Analysis (W. H. Freeman, San Francisco 1974).Google Scholar
[2]Lee Minsky, Marvin and Papert, Seymour, Perceptrons: an introduction to computational geometry (MIT Press, Cambridge, Massachusetts 1988).Google Scholar