General Theory of Optimal Error Algorithms and Analytic Complexity. Part B. Iterative Information Model
Author: J. F. Traub
Publisher:
Published: 1978
Total Pages: 97
ISBN-13:
DOWNLOAD EBOOKThis is the second of a series of papers in which we construct an information based general theory of optimal error algorithms and analytic computational complexity and study applications of the general theory. In our first paper we studied a general information' model; here we study an 'iterative information' model. We give a general paradigm, based on the pre-image set of an information operator, for obtaining a lower bound on the error of any algorithm using this information. We show that the order of information provides an upper bound on the order of any algorithm using this information. This upper bound order leads to a lower bound on the complexity index.