Institute Output
Kolmogorov Complexity vs. Computational Irreducibility: Understanding the Distinction
James K. Wiles
Kolmogorov complexity and computational irreducibility describe two kinds of limits on simplification, but they apply in different ways. Kolmogorov complexity measures the shortest possible description of an object, such as a string. Computational irreducibility refers to processes that cannot be predicted or accelerated. This paper introduces each concept, explains their theoretical distinction, and illustrates the difference using simple examples.
Computational Metaphysics: A Survey of the Ruliad, Observer Theory and Emerging Frameworks
James K. Wiles
A concise survey of how recent computational models, such as the ruliad and observer theory, are transforming metaphysical questions into formal, testable frameworks.
Identifying and Manipulating Personality Traits in LLMs Through Activation Engineering
Rumi A. Allbert, James K. Wiles
An exploration into the latent space of Large Language Models to find and steer the personality of Generative Artificial Intelligence