de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

On the representation of multi-input systems: Computational properties of polynomial algorithms

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons84160

Reichardt,  W
Former Department Information Processing in Insects, Max Planck Institute for Biological Cybernetics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Poggio, T., & Reichardt, W. (1980). On the representation of multi-input systems: Computational properties of polynomial algorithms. Biological Cybernetics, 37(3), 167-186. doi:10.1007/BF00355455.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-F100-9
Abstract
This paper introduces a theoretical framework for characterizing and classifying simple parallel algorithms and systems with many inputs, for example an array of photoreceptors. The polynomial representation (Taylor series development) of a large class of operators is introduced and its range of validity discussed. The problems involved in the polynomial approximation of systems are also briefly reviewed. Symmetry properties of the input-output map and their implications for the system structure (i.e. its kernels) are studied. Finally, the computational properties of polynomial mappings are characterized.