Pages that link to "Item:Q5579041"

The following pages link to On the Length of Programs for Computing Finite Binary Sequences (Q5579041):

Displaying 45 items.

• Turing patterns with Turing machines: emergence and low-level structure formation (Q256719) (← links)
• Exploring programmable self-assembly in non-DNA based molecular computing (Q269774) (← links)
• Disentangling complexity from randomness and chaos (Q405986) (← links)
• Quantum Kolmogorov complexity and information-disturbance theorem (Q657557) (← links)
• Algorithmic relative complexity (Q657564) (← links)
• Toward an abstract theory of data compression (Q794162) (← links)
• Large alphabets and incompressibility (Q845735) (← links)
• Information measures for infinite sequences (Q974755) (← links)
• On the notion of infinite pseudorandom sequences (Q1091817) (← links)
• Generic oracles, uniform machines, and codes (Q1184732) (← links)
• Inductive reasoning and Kolmogorov complexity (Q1190991) (← links)
• LISP program-size complexity (Q1194454) (← links)
• LISP program-size complexity. III (Q1200220) (← links)
• Fluctuation spectroscopy (Q1321719) (← links)
• Computational depth and reducibility (Q1334655) (← links)
• The discovery of algorithmic probability (Q1370859) (← links)
• Stochastic complexity in learning (Q1370860) (← links)
• Quantitative and qualitative growth analysis (Q1433609) (← links)
• Complexity as a contrast between dynamics and phenomenology (Q1672356) (← links)
• Structure and randomness of continuous-time, discrete-event processes (Q1685489) (← links)
• A computable measure of algorithmic probability by finite approximations with an application to integer sequences (Q1693803) (← links)
• Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks (Q1782785) (← links)
• Symmetry of information and one-way functions (Q1802066) (← links)
• The calculi of emergence: Computation, dynamics and induction (Q1817022) (← links)
• The dimensions of individual strings and sequences (Q1887139) (← links)
• Model selection based on minimum description length (Q1977908) (← links)
• Thinking with notations: epistemic actions and epistemic activities in mathematical practice (Q2101897) (← links)
• Descriptive complexity of computable sequences revisited (Q2290652) (← links)
• Leveraging environmental correlations: the thermodynamics of requisite variety (Q2410023) (← links)
• A Note on Blum Static Complexity Measures (Q2891303) (← links)
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT (Q3021972) (← links)
• Degrees of monotone complexity (Q3416117) (← links)
• Differential equations as deterministic models in science and technology Part I: Modelling (Q3491478) (← links)
• On initial segment complexity and degrees of randomness (Q3506714) (← links)
• COMPLEXITY, INFORMATION, ENERGY (Q3526535) (← links)
• Minimal-program complexity of pseudo-recursive and pseudo-random sequences (Q4065032) (← links)
• Computational depth and reducibility (Q4630267) (← links)
• Alan Turing and the Foundation of Computer Science (Q4637224) (← links)
• Relations between varieties of kolmogorov complexities (Q4879210) (← links)
• Dimension spectra of lines1 (Q5075516) (← links)
• Face Representations via Tensorfaces of Various Complexities (Q5131175) (← links)
• Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness (Q5250214) (← links)
• A Quest for Algorithmically Random Infinite Structures, II (Q5283425) (← links)
• Descriptive complexity of computable sequences (Q5958281) (← links)
• Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers (Q6612803) (← links)