Accession Number:

ADA046860

Title:

General Theory of Optimal Error Algorithms and Analytic Complexity. Part A. General Information Model.

Descriptive Note:

Interim rept.,

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1977-09-01

Pagination or Media Count:

95.0

Abstract:

This is the first of a series of papers constructing an information based general theory of optimal errors and analytic computational complexity. Among the applications are such traditionally diverse areas as approximation, boundary-value problems, quadrature, and nonlinear equations in a finite or infinite dimensional space. Traditionally algorithms are often derived by ad hoc criteria. The information based theory rationalizes the synthesis of algorithms by showing how to construct algorithms which minimize or nearly minimize the error. For certain classes of problems it shows how to construct algorithms linear optimal error algorithms which enjoy essentially optimal complexity with respect to all possible algorithms. The existence of strongly non-computable problems is demonstrated. In contrast with the gap theorem of recursively computable functions it is shown that every monotonic real function is the complexity of some problem.

Subject Categories:

  • Theoretical Mathematics
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE