Algorithmic Randomness, Exchangeability, and the Principal Principle

• URL: http://arxiv.org/abs/2510.24054v1
• Date: Tue, 28 Oct 2025 04:26:19 GMT
• Title: Algorithmic Randomness, Exchangeability, and the Principal Principle
• Authors: Jeffrey A. Barrett, Eddy Keming Chen,
• Abstract summary: We show how one might use the framework to derive the Principal Principle.<n>The Principal Principle emerges as a mathematical consequence of the alignment between nomological constraints and inductive learning.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We introduce a framework uniting algorithmic randomness with exchangeable credences to address foundational questions in philosophy of probability and philosophy of science. To demonstrate its power, we show how one might use the framework to derive the Principal Principle -- the norm that rational credence should match known objective chance -- without circularity. The derivation brings together de Finetti's exchangeability, Martin-L\"of randomness, Lewis's and Skyrms's chance-credence norms, and statistical constraining laws (arXiv:2303.01411). Laws that constrain histories to algorithmically random sequences naturally pair with exchangeable credences encoding inductive symmetries. Using the de Finetti representation theorem, we show that this pairing directly entails the Principal Principle of this framework. We extend the proof to partial exchangeability and provide finite-history bounds that vanish in the infinite limit. The Principal Principle thus emerges as a mathematical consequence of the alignment between nomological constraints and inductive learning. This reveals how algorithmic randomness and exchangeability can illuminate foundational questions about chance, frequency, and rational belief.

Related papers

• Operational Derivation of Born's Rule from Causal Consistency in Generalized Probabilistic Theories [0.0]
  We show that any admissible state-to-probability map must be affine under mixing.<n>We identify Born's rule as a causal fixed point among admissible probabilistic laws.
  arXiv  Detail & Related papers  (2025-12-14T10:50:42Z)
• Connecting classical finite exchangeability to quantum theory [45.76759085727843]
  Exchangeability is a fundamental concept in probability theory and statistics.<n>It allows to model situations where the order of observations does not matter.<n>It is well known that both theorems do not hold for finitely exchangeable sequences.
  arXiv  Detail & Related papers  (2023-06-06T17:15:19Z)
• A Measure-Theoretic Axiomatisation of Causality [55.6970314129444]
  We argue in favour of taking Kolmogorov's measure-theoretic axiomatisation of probability as the starting point towards an axiomatisation of causality. Our proposed framework is rigorously grounded in measure theory, but it also sheds light on long-standing limitations of existing frameworks.
  arXiv  Detail & Related papers  (2023-05-19T13:15:48Z)
• Algorithmic Randomness and Probabilistic Laws [0.0]
  We develop two ways to use algorithmic randomness to characterize probabilistic laws of nature.<n>The first, a generative chance* law, employs a nonstandard notion of chance.<n>The second, a probabilistic* constraining law, impose relative frequency and constraints that every physically possible world must satisfy.
  arXiv  Detail & Related papers  (2023-03-02T17:00:40Z)
• Symbolic Recovery of Differential Equations: The Identifiability Problem [52.158782751264205]
  Symbolic recovery of differential equations is the ambitious attempt at automating the derivation of governing equations. We provide both necessary and sufficient conditions for a function to uniquely determine the corresponding differential equation. We then use our results to devise numerical algorithms aiming to determine whether a function solves a differential equation uniquely.
  arXiv  Detail & Related papers  (2022-10-15T17:32:49Z)
• Probabilistic Deduction: an Approach to Probabilistic Structured Argumentation [1.027974860479791]
  Probabilistic Deduction (PD) is an approach to probabilistic structured argumentation. PD provides a framework to unify probabilistic reasoning with argumentative reasoning. This is the first work in probabilistic structured argumentation where the joint distribution is not assumed form external sources.
  arXiv  Detail & Related papers  (2022-09-01T03:58:38Z)
• A Fundamental Probabilistic Fuzzy Logic Framework Suitable for Causal Reasoning [0.0]
  We introduce a fundamental framework to create a bridge between Probability and Fuzzy Logic. Our theory formulates a random experiment of selecting crisp elements with the criterion of having a certain fuzzy attribute. Several formulas are presented, which make it easier to compute different conditional probabilities and expected values of random variables.
  arXiv  Detail & Related papers  (2022-05-30T11:59:35Z)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)
• Logical Neural Networks [51.46602187496816]
  We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning) Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation. Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
  arXiv  Detail & Related papers  (2020-06-23T16:55:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.