Pages that link to "Item:Q5626617"
From MaRDI portal
The following pages link to THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS (Q5626617):
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)
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- Monoidal computer. I: Basic computability by string diagrams (Q385721) (← links)
- Conditional Kolmogorov complexity and universal probability (Q391323) (← links)
- Strict process machine complexity (Q403400) (← links)
- A linearly computable measure of string complexity (Q441859) (← links)
- Short lists for shortest descriptions in short time (Q475336) (← links)
- Random sequences with respect to a measure defined by two linear fractional transformations (Q493656) (← links)
- Fractal dimension versus process complexity (Q504699) (← links)
- Randomness for computable measures and initial segment complexity (Q508835) (← links)
- Randomness on computable probability spaces -- a dynamical point of view (Q537913) (← links)
- Program size complexity for possibly infinite computations (Q558440) (← links)
- Oscillation in the initial segment complexity of random reals (Q633597) (← links)
- Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov) (Q638490) (← links)
- Error-correcting codes and phase transitions (Q691642) (← links)
- On empirical meaning of randomness with respect to parametric families of probability distributions (Q692926) (← links)
- Process and truth-table characterisations of randomness (Q714787) (← links)
- Nonapproximability of the normalized information distance (Q716306) (← links)
- Effective entropies and data compression (Q751832) (← links)
- Constructive chaos by cellular automata and possible sources of an arrow of time (Q751849) (← links)
- Martin-Löf randomness and Galton-Watson processes (Q764271) (← links)
- On the syntactic structure of protein sequences and the concept of grammar complexity (Q801840) (← links)
- Constructive dimension equals Kolmogorov complexity (Q835015) (← links)
- Dynamic modeling of internet traffic for intrusion detection (Q838848) (← links)
- Quantum cooperative search algorithm for 3-sat (Q859988) (← links)
- On generalized computable universal priors and their convergence (Q860822) (← links)
- Algorithmic complexity bounds on future prediction errors (Q865627) (← links)
- Milking the Aanderaa argument (Q918198) (← links)
- Efficient coding of approximations of real numbers (Q918941) (← links)
- Effectively closed sets of measures and randomness (Q958494) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Kolmogorov-Loveland stochasticity and Kolmogorov complexity (Q968271) (← links)
- On a definition of random sequences with respect to conditional probability (Q999259) (← links)
- Gales suffice for constructive dimension (Q1007560) (← links)
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets (Q1015370) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- On calibration error of randomized forecasting algorithms (Q1017657) (← links)
- On universal transfer learning (Q1017661) (← links)
- Instability, complexity, and evolution (Q1036993) (← links)
- Stationary algorithmic probability (Q1041228) (← links)
- The dynamics of symmetric nets (Q1053636) (← links)
- On the relation between descriptional complexity and algorithmic probability (Q1057064) (← links)
- On the notion of infinite pseudorandom sequences (Q1091817) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Complexity of functions: Some questions, conjectures, and results (Q1174450) (← links)
- Some properties of random number generators (Q1175846) (← links)
- Average case completeness (Q1176231) (← links)
- Organization by rules in finite sequences (Q1184255) (← links)
- Inductive reasoning and Kolmogorov complexity (Q1190991) (← links)
