Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets (Q818126): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979345712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity for possibly infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program size complexity for possibly infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random reals and possibly infinite computations Part I: Randomness in ∅′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4665731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and set theoretical representations of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial foundations of information theory and the calculus of probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140968 / rank
 
Normal rank

Latest revision as of 12:28, 24 June 2024

scientific article
Language Label Description Also known as
English
Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
scientific article

    Statements

    Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets (English)
    0 references
    0 references
    0 references
    24 March 2006
    0 references
    0 references
    Kolmogorov complexity
    0 references
    infinite computation
    0 references
    0 references