THEORY OF ADAPTIVE MECHANISMS. PART I. SELECTED TOPICS IN AUTOMATA THEORY. PART II. IDEALIZED MACHINES, FORMAL SYSTEMS, AND RECURSIVE FUNCTIONS.
Abstract
In this project, the various subjects covered are: (1) Computational Complexity and Iterative Arrays, (2) A Generalized Firing Squad Problem, (3) Asynchronous Systems for Infinite Arrays, (4) Computer Theorem Proving, (5) Idealized Machines, Formal Systems, and Recursive Functions, (6) Simulation of Analog Computers on an Iterative Array Computer, (7) Firing Squad Simulation Program, (8) Matrix Multiplication on an Iterative Array, (9) An Iterative Array Pseudo-Random Number Generator, (10) A Supplement to RADICAL Manual. The studies are issued in four separate interim technical reports; (1) through (4), (5), (6) through (9), and (10) are the groupings. Part II - The theories of Turing machines, W-machines, Markov Algorithms, Post System, Recursive Functions, and the Calculus of Lambda Conversion are presented. Each of these has in common the use of a finite alphabet, a finite number of rules, and a potentially infinite amount of working space, and each may be considered as a special case of a general theory of algorithms.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1967
- Accession Number
- AD0664351
Entities
People
- F. R. Moore
- G. G. Langdon
- R. G. Cantarella
- V. C. Hamacher
Organizations
- Syracuse University