On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers

Authors:
Gregory J. Chaitin
Affiliations:
Mario Bravo 249, Buenos Aires, Argentina and Buenos Aires, Argentina
Venue:
Journal of the ACM (JACM)
Year:
1969

Citing 3
Cited 3

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)

Instance complexity

Journal of the ACM (JACM)
Algorithmic complexity as a criterion of unsolvability

Theoretical Computer Science
Algorithmic information theory

IBM Journal of Research and Development

Quantified Score

Hi-index	0.01

Visualization

Abstract