John H. Holland
ABSTRACT
The paper first discusses an example of a computer, intended as a prototype of a practical computer, having an iterative structure and capable of processing arbitrarily many words of stored data at the same time, each by a different sub-program if desired. Next a mathematical characterization is given of a broad class of computers satisfying the conditions just stated. Finally the characterization is related to a program aimed at establishing a theory of adaptive systems via the concept of automaton generators.
- Burks, Arthur W., "Computation, Behavior, and Structure in Fixed and Growing Automata" University of Michigan Technical Report ONR Contract 1224(21) (1959).Google Scholar
- Burks, Arthur W. and Hao Wang, "The Logic of Automata" J. Assoc. Computing Mach. 4, 2 & 3, 193--218, 279--297 (1957). Google ScholarDigital Library
- Church, Alonzo, "Application of Recursive Arithmatic in the Theory of Computers and Automata" notes from summer conference course in Advanced Theory of the Logical Design of Digital Computers, The University of Michigan (1958).Google Scholar
- Friedberg, R. M., "A Learning Machine: Part 1" IBM Journal of Research and Development 2, 1, 2--13 (1958).Google ScholarDigital Library
- Holland, J. H., "A Universal Computer Capable of Executing an Arbitrary Number of Sub-Programs Simultaneously" Proc. 1959 Eastern Joint Computer Conference. Google ScholarDigital Library
- Kleene, S. C., "Representation of Events in Nerve Nets and Finite Automata" in Automata Studies Annals of Mathematics Studies no. 34, Princeton (1956).Google Scholar
- Moore, Edward F., "Machine Models of Self-Reproduction" paper (560-52) at October Meeting of the American Mathematical Society, Cambridge, Mass. (1959).Google Scholar
- Newell, A., J. C. Shaw and H. A. Simon, "Empirical Explorations of the Logic Theory Machine: A Case Study in Heuristics", Report P-951, Rand Corporation (1957).Google ScholarDigital Library
- Rabin, M. O., and D. Scott, "Finite Automata and Their Decision Problems" IBM Journal of Research and Development 3, 2, 114--125(1959).Google ScholarDigital Library
- Samuel, A. L., "Some Studies in Machine Learning, Using the Game of Checkers" IBM Journal of Research and Development 3, 3, 210--229 (1959).Google ScholarDigital Library
- Southwell, R. V., Relaxation Methods in Engineering Science; a Treatise on Approximate Computation, Clarendon Press, Oxford (1940).Google Scholar
- Turing, A. M., "On Computable Numbers, with an Application to the Entscheidungsproblem" Proc. Lond. Math. Soc. (2), 43, 230--265 (1936).Google Scholar
- Turing, A. M., "The Chemical Basis of Morphogenesis", Phil. Trans. Roy. Soc., ser. B, 237, 37 ff. (1952).Google Scholar
- Von Neumann, J., The Theory of Automata, unpublished manuscript.Google Scholar
Recommendations
Personal computers in the undergraduate curriculum: an example
The authors will show how off-the-shelf personal computers can be used in a variety of ways and at a number of levels to enrich the study of computers at small colleges. It is not our intent to suggest that personal computers replace larger mainframes ...
Searching an Unsorted Database in Quantum Computers and Duality Quantum Computers
ICNC '09: Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 05Quantum computers exploits quantum entanglement and provides more computing power. Duality quantum computer is a new type of quantum computer that exploits the particle wave duality of quantum mechanics. In a duality computer, the computing gates need ...
Comments