Accession Number : AD0685520
Title : PROBLEMS OF DISCRETE EXTRAPOLATION,
Corporate Author : FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Personal Author(s) : Blokh,A. Sh.
Report Date : 16 OCT 1968
Pagination or Media Count : 6
Abstract : The article is a continuation of previous works by the author in which the problem of pattern recognition and the method of incomplete mathematical induction were interpreted respectively as interpolation and extrapolation of arithmetic functions. A general principle was formulated stating that the arithmetic functions should be defined in such a way that the algorithm for computation requires a minimum number of memory cells. Problems relating to formulation of this principle for the case of discrete extrapolation are examined in this paper. A simplified model of a control machine is proposed in which memory organization is described by a single table of addresses. The program for computing the arithmetic function is given by a finite or infinite Moore automaton. The automaton may be binary, ternary or some other type, depending on the computational system. Although only binary automata are considered in this article, the results are valid for any Moore automaton in the proper formulation.
Descriptors : (*PATTERN RECOGNITION, AUTOMATA), MATHEMATICAL LOGIC, COMPUTER LOGIC, COMPUTER PROGRAMMING, DATA STORAGE SYSTEMS, INTERPOLATION, THEOREMS, USSR
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE