Information-theoretic characterizations of recursive infinite strings
type: Item
instance of: scholarly article
title: Information-theoretic characterizations of recursive infinite strings
zbMATH Open document ID: 0328.02029
DOI: 10.1016/0304-3975(76)90005-0
author: Gregory J. Chaitin
published in: Theoretical Computer Science
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D80
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94A15
zbMATH DE Number: 3513765
MaRDI profile type: Publication
full work available at URL: 0304-3975(76)90005-0
OpenAlex ID: W1997686864
cites work: Information-Theoretic Incompleteness
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: A variant of the Kolmogorov concept of complexity
cites work: Process complexity and effective random tests
description: scientific article; zbMATH DE number 3513765