Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"Algorithmic Information Theory"”.

  1. Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation

    … primary goal of this dissertation is to employ Algorithmic Information Theory (AIT), also known as Kolmogorov complexity, to unravel the information complexity of GRNs and the resultant multicellular patterns. To obtain a better understanding of Kolmogorov complexity performance, first we study …

    utahstate Repository record for Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation (opens in a new tab)

  2. Physics and Computation

    … deals with partition functions in physics and algorithmic information theory. In physics, partition functions are used to encode information about statistical systems in thermal equilibrium; in algorithmic information theory, they are used to encode information about the probability that a …

    auckland-ms Repository record for Physics and Computation (opens in a new tab)

  3. Universal Transfer Learning

    … elegant and beautiful ideas from the field of Algorithmic Information Theory. While developing our transfer learning mechanisms we also derive results that are interesting in and of themselves. We also developed practical approximations to our formally optimal method for Bayesian decision …

    uiuc Repository record for Universal Transfer Learning (opens in a new tab)

  4. Forecast ergodicity and instantaneous active information.

    This dissertation introduces two new information theory tools for machine learning. Forecast ergodicity models prediction using algorithmic information theory, stating that future data can be forecasted if it has the same structure as past data. The novelty of this approach is that it is …

    baylor Repository record for Forecast ergodicity and instantaneous active information. (opens in a new tab) Embargoed until 2028-08-15

  5. Really Real Patterns

    … computational modeling, pattern recognition, and algorithmic information theory. As I argue, these conceptual tools allow us to place pattern-based accounts of non-fundamental ontology (esp. Dennett, 1991) on a firmer theoretical foundation. More concretely, I propose a novel, rigorous, and …

    arizona-thes Repository record for Really Real Patterns (opens in a new tab)

  6. Probabilistic bias in genotype-phenotype maps

    … shared by all organisms is the mapping of information encoded in <em>genotypes</em> (genetic material) to generate <em>phenotypes</em> (biological structures, functions, and traits). Hence, elucidating the structure of <em>genotype-phenotype (GP) maps</em> is important for understanding …

    oxford Repository record for Probabilistic bias in genotype-phenotype maps (opens in a new tab)

  7. Aesthetic Automata: Synthesis and Simulation of Aesthetic Behaviour in Cellular Automata

    … approaches to aesthetics. Shannon's information theory provided an objective measure of complexity, which led to the emergence of various informational theories of aesthetics. However, entropy fails to take into account the spatial characteristics of 2D patterns; these characteristics …

    goldsmiths Repository record for Aesthetic Automata: Synthesis and Simulation of Aesthetic Behaviour in Cellular Automata (opens in a new tab) Download PDF for Aesthetic Automata: Synthesis and Simulation of Aesthetic Behaviour in Cellular Automata (opens in a new tab)

  8. The complexity and distribution of computationally useful problems

    … problem contain large amounts of useful information about computation that is highly organized and readily available to efficient computational processes. Such problems are computationally useful. This dissertation investigates the complexity and distribution of these computationally …

    iastate Repository record for The complexity and distribution of computationally useful problems (opens in a new tab)

  9. Some results on Kolmogorov-Loveland randomness

    … is a well known open question in the field of algorithmic information theory. Randomness of infinite binary sequences can be defined in terms of betting strategies, a string is non-random if a computable betting strategy wins unbounded capital by successive betting on the sequence. For …

    bu Repository record for Some results on Kolmogorov-Loveland randomness (opens in a new tab)

  10. Genotype-phenotype maps for gene networks: from evolution to computation

    … more general.</p> <p>First, we apply tools from algorithmic information theory to a wide class of inputoutput maps, of which GP maps are a subset. We find that these maps show a strong bias towards simple phenotypes, a pattern known as <em>simplicity bias</em>. We also define a <em>matrix …

    oxford Repository record for Genotype-phenotype maps for gene networks: from evolution to computation (opens in a new tab)

  11. An Investigation of Feasible Logical Depth and Complexity Measures via Automata and Compression Algorithms

    … Kolmogorov Complexity is a fundamental tool of Algorithmic Information Theory which measures the complexity of such objects. However, there is one major problem: Kolmogorov Complexity is uncomputable. As such, the complexity of such objects are often studied in lower computable settings. This …

    maynooth Download PDF for An Investigation of Feasible Logical Depth and Complexity Measures via Automata and Compression Algorithms (opens in a new tab)

  12. An information theoretic approach to the expressiveness of programming languages

    … λ-Calculus, SKI, RASP, RASP2, and RASP3. The information content of the programs and models are measured as characters. They are compared to investigate hypotheses relating to how the mean program size changes as the size of the semantics change, and how the relationship of mean program sizes …

    glasgow Download PDF for An information theoretic approach to the expressiveness of programming languages (opens in a new tab)

  13. Dynamics, measure and dimension in the theory of computing

    <p>This thesis establishes some results in algorithmic information</p> <p>theory. Martin-Lof in 1966 formalized the notion of what it means</p> <p>for a given sequence to be random, using the theory of</p> <p>computation. Equivalent, alternate definitions justify that this</p> <p>definition is …

    iastate Repository record for Dynamics, measure and dimension in the theory of computing (opens in a new tab)

  14. Mutual dimension, data processing inequalities, and randomness

    … for mutual dimension, i.e., the density of algorithmic mutual information between two infinite objects, that has similar properties as those of classical Shannon mutual information.</p> <p>Chapter 1 presents a brief history of the development of constructive dimension along with its …

    iastate Repository record for Mutual dimension, data processing inequalities, and randomness (opens in a new tab)