Program Size Complexity for Possibly Infinite Computations
Work
Year: 2005
Type: article
Abstract: We define a program size complexity function $H^\infty$ as a variant of the prefix-free Kolmogorov complexity, based on Turing monotone machines performing possibly unending computations. We consider ... more
Institutions University of Buenos Aires, University of Auckland
Cites: 13
Cited by: 9
Related to: 10
FWCI: 1.933
Citation percentile (by year/subfield): 67.5
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid