Affiliation:
1. The City College of the City University of New York, New York, N. Y.
Abstract
The use of Turing machines for calculating finite binary sequences is studied from the point of view of information theory and the theory of recursive functions. Various results are obtained concerning the number of instructions in programs. A modified form of Turing machine is studied from the same point of view. An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference11 articles.
1. A mathematical theory of communication;SHANON C. E.;Bell Syst. Tech. J.,1948
2. TURNING A. M. O computable mlmbers with an application to the Entscheidungsproblare. Prec. London Math. See. {2}2 (19337) 230=265; Correction ibid 43 (1937) 544- TURNING A. M. O computable mlmbers with an application to the Entscheidungsproblare. Prec. London Math. See. {2}2 (19337) 230=265; Correction ibid 43 (1937) 544-
Cited by
717 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献