Kolmogorov complexity for possibly infinite computations
type: Item
instance of: scholarly article
title: Kolmogorov complexity for possibly infinite computations
zbMATH Open document ID: 1075.68034
author: Verónica Becher
author: Santiago Figueira
published in: Journal of Logic, Language and Information
publication date: 2005-05-13T00:00:00Z
full work available at URL: http://sedici.unlp.edu.ar/handle/10915/22767
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 2168170
zbMATH Keywords: infinite computations
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: monotone machines
zbMATH Keywords: non-effective computations
zbMATH Keywords: program-size complexity
zbMATH Keywords: Turing machines
MaRDI profile type: Publication
OpenAlex ID: W2151438660
Wikidata QID: Q61927037
cites work: Q2752143
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Algorithmic entropy of sets
cites work: Information-theoretic characterizations of recursive infinite strings
cites work: Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
cites work: Several results in program size complexity
cites work: Q3214803
cites work: Q4337021
cites work: A variant of the Kolmogorov concept of complexity
cites work: On degrees of unsolvability
DOI: 10.1007/S10849-005-2255-6
description: scientific article; zbMATH DE number 2168170