• Corpus ID: 231719808

Computational irreducibility and compatibilism: towards a formalization

@article{Krumm2021ComputationalIA,
  title={Computational irreducibility and compatibilism: towards a formalization},
  author={Marius Krumm and Markus P. Mueller},
  journal={ArXiv},
  year={2021},
  volume={abs/2101.12033}
}
If our actions are determined by the laws of nature, can we meaningfully claim to possess free will? Compatibilists argue that the answer is yes, and that free will is compatible with complete determinism. Previously, it has been suggested that the notion of computational irreducibility can shed light on this relation: it implies that there cannot in general be “shortcuts” to the decisions of agents, explaining why deterministic agents often appear to have free will. In this paper, we introduce… 

Figures from this paper

References

SHOWING 1-10 OF 24 REFERENCES
A Turing test for free will
  • S. Lloyd
  • Philosophy
    Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2012
TLDR
A ‘Turing test’ for free will is proposed: a decision-maker who passes this test will tend to believe that he, she, or it possesses free will, whether the world is deterministic or not.
Computational Irreducibility and Computational Analogy
  • H. Zwirn
  • Computer Science, Mathematics
    Complex Syst.
  • 2015
TLDR
This work introduces a new concept: the computational analogy, and proves some properties of the functions used, which allows partitioning the set of computable functions in classes whose members have the same properties regarding their CIR and their computational complexity.
Church's Thesis and Principles for Mechanisms
Empirical Encounters with Computational Irreducibility and Unpredictability
The paper presents an exploration of conceptual issues that have arisen in the course of investigating speed-up and slowdown phenomena in small Turing machines, in particular results of a test that
Unpredictability and Computational Irreducibility
TLDR
It is proved that, through a robust definition of what means “to be unable to compute the n th step without having to follow the same path than simulating the automaton”, this implies genuinely that if the behavior of an object is computationally irreducible, no computation of its n th state can be faster than the simulation itself.
Free Will and A New Kind of Science
What does Wolfram’s new kind of science (nks w ) imply about the decidedly non-new topic of free will versus determinism? I answer this question herein. More specifically, I point out that Wolfram’s
The Physical Church-Turing Thesis and the Principles of Quantum Theory
TLDR
This approach exhibits a formal non-trivial interplay between theoretical physics symmetries and computability assumptions, and provides a quantum version of the Church-Turing theorem.
Concurrency and Automata on Infinite Sequences
  • D. Park
  • Computer Science
    Theoretical Computer Science
  • 1981
TLDR
A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.
An Introduction to Kolmogorov Complexity and Its Applications
TLDR
The book presents a thorough treatment of the central ideas and their applications of Kolmogorov complexity with a wide range of illustrative applications, and will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics.
An Algebraic Definition of Simulation Between Programs
TLDR
A technique is given and illustrated for proving simulation and equivalence of programs; there is an analogy with Floyd''s technique for proving correctness of programs.
...
...