Complexity of Information Extraction

<p>This thesis describes a mathematical theory that interrelates the basic concepts of complexity, cost, information and reliability. The accessibility of information, as opposed to its availability, is characterized. Universal bounds for complexity distribution, implementation cost and decisi...

Full description

Bibliographic Details
Main Author: Abu-Mostafa, Yaser Said
Format: Others
Published: 1983
Online Access:https://thesis.library.caltech.edu/1786/4/abu-mostafa-ys_1983.pdf
Abu-Mostafa, Yaser Said (1983) Complexity of Information Extraction. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/FVKM-7J60. https://resolver.caltech.edu/CaltechETD:etd-05142003-111719 <https://resolver.caltech.edu/CaltechETD:etd-05142003-111719>
Description
Summary:<p>This thesis describes a mathematical theory that interrelates the basic concepts of complexity, cost, information and reliability. The accessibility of information, as opposed to its availability, is characterized. Universal bounds for complexity distribution, implementation cost and decision reliability are estimated. These bounds give rise to a methodology for any consistent definition of a complexity measure. The basic notions of pattern recognition and information theory are directly related to computational complexity.</p>