Time-Bounded Kolmogorov Complexity and Solovay Functions

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-03816-7_34
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Kolmogorov Complexity and Algorithmic Randomness

Mathematical Surveys and Monographs
2017English

Combinatorial Interpretation of Kolmogorov Complexity

English

A Strange Application of Kolmogorov Complexity

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1998English

Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2000English

Nonreducible Descriptions for the Conditional Kolmogorov Complexity

Problems of Information Transmission
Computer NetworksComputer Science ApplicationsInformation SystemsCommunications
2005English

Complexity of Large Time Behaviour of Evolution Equations With Bounded Data

2004English

Quasi-Bounded and Singular Functions

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1974English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

Functions of Bounded Variation

A First Course in Sobolev Spaces
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy