Thumbnail
Access Restriction
Subscribed

Author Chaitin, Gregory J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1966
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1966-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 13
Issue Number 4
Page Count 23
Starting Page 547
Ending Page 569


Open content in new tab

   Open content in new tab
Source: ACM Digital Library