An Example of Information and Computation Resource Trade-Off

Authors:
Robert P. Daley
Affiliations:
Committee on the Information Sciences, The University of Chicago, Chicago, Illinois
Venue:
Journal of the ACM (JACM)
Year:
1973

Citing 5
Cited 3

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
On the Length of Programs for Computing Finite Binary Sequences

Journal of the ACM (JACM)
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations

Journal of the ACM (JACM)
On minimal-program complexity measures

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing

Complex Properties of Grammars

Journal of the ACM (JACM)
Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)
The extent and density of sequences within the minimal-program complexity hierarchies

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract