Pages that link to "Item:Q4068087"
From MaRDI portal
The following pages link to A Theory of Program Size Formally Identical to Information Theory (Q4068087):
Displaying 50 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite (Q285515) (← links)
- Relating and contrasting plain and prefix Kolmogorov complexity (Q285520) (← links)
- Universal computably enumerable sets and initial segment prefix-free complexity (Q391648) (← links)
- Fixed point theorems on partial randomness (Q408531) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Constraints placed on random sequences by their compressibility (Q449434) (← links)
- Information-geometric approach to inferring causal directions (Q456729) (← links)
- Characterizing the strongly jump-traceable sets via randomness (Q456804) (← links)
- Random sequences with respect to a measure defined by two linear fractional transformations (Q493656) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs (Q494650) (← links)
- Randomness for computable measures and initial segment complexity (Q508835) (← links)
- Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness (Q519903) (← links)
- Random numbers as probabilities of machine behavior (Q524278) (← links)
- Kobayashi compressibility (Q528498) (← links)
- Universal recursively enumerable sets of strings (Q533863) (← links)
- On the algorithmic complexity of static structures (Q545415) (← links)
- Program size complexity for possibly infinite computations (Q558440) (← links)
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- Oscillation in the initial segment complexity of random reals (Q633597) (← links)
- Elementary differences between the degrees of unsolvability and degrees of compressibility (Q636334) (← links)
- On the number of infinite sequences with trivial initial segment complexity (Q655422) (← links)
- Representation of left-computable \(\varepsilon \)-random reals (Q716316) (← links)
- Computing halting probabilities from other halting probabilities (Q729891) (← links)
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega (Q736609) (← links)
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data (Q742695) (← links)
- Toward an abstract theory of data compression (Q794162) (← links)
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets (Q818126) (← links)
- Characterising the Martin-Löf random sequences using computably enumerable sets of measure one (Q834927) (← links)
- Natural halting probabilities, partial randomness, and zeta functions (Q859830) (← links)
- On generalized computable universal priors and their convergence (Q860822) (← links)
- Randomness and universal machines (Q864423) (← links)
- Undecidability of the structure of the Solovay degrees of c.e. reals (Q881596) (← links)
- The cellular computer DNA: Program or data (Q912788) (← links)
- Schnorr trivial reals: a construction (Q926182) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- On universal transfer learning (Q1017661) (← links)
- Stationary algorithmic probability (Q1041228) (← links)
- On the relation between descriptional complexity and algorithmic probability (Q1057064) (← links)
- Uncontrollable computational growth in theoretical physics (Q1071512) (← links)
- On the notion of infinite pseudorandom sequences (Q1091817) (← links)
- Incompleteness theorems for random reals (Q1105595) (← links)
- On randomness, determinism and computability (Q1120202) (← links)
- Several results in program size complexity (Q1152214) (← links)
- Generic oracles, uniform machines, and codes (Q1184732) (← links)
- On independent random oracles (Q1185000) (← links)
