Citation
Abu-Mostafa, Yaser Said (1983) Complexity of information extraction. Dissertation, California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-05142003-111719
Abstract
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.
| Item Type: | Thesis (Dissertation) |
|---|---|
| Degree Grantor: | California Institute of Technology |
| Major Option: | Electrical Engineering |
| Thesis Availability: | Public (worldwide access) |
| Thesis Committee: |
|
| Defense Date: | 23 May 1983 |
| Record Number: | CaltechETD:etd-05142003-111719 |
| Persistent URL: | http://resolver.caltech.edu/CaltechETD:etd-05142003-111719 |
| Default Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 1786 |
| Collection: | CaltechTHESIS |
| Deposited By: | Imported from ETD-db |
| Deposited On: | 14 May 2003 |
| Last Modified: | 06 Oct 2009 14:36 |
Thesis Files
![[img]](/style/images/fileicons/application_pdf.png)
| PDF (Abu-Mostafa_ys_1983.pdf) - Final Version See Usage Policy. 2487Kb |
Repository Staff Only: item control page
