The Limits of Mathematics
arXiv:chao-dyn/9509021
Abstract
This condensed version of chao-dyn/9509010 will be the main hand-out for a course on algorithmic information theory to be given 22-29 May 1996 at the Rovaniemi Institute of Technology, Rovaniemi, Finland (see announcement at http://www.rotol.fi/ ).
LaTeX, 45 pages
Cited by in corpus (21)
- Rethinking Superdeterminism
- The Berry Paradox
- The Physics of Information
- Algorithmic Information Theoretic Issues in Quantum Mechanics
- Leibniz, Information, Math and Physics
- A Mathematical Random Number Generator (MRNG)
- Incompleteness, Complexity, Randomness and Beyond
- How to Run Algorithmic Information Theory on a Computer
- The Limits of Mathematics---The Book
- A Formal System: Rigorous Constructions of Computer Models
- Is Complexity a Source of Incompleteness?
- A theory of experiment
- The Limits of Mathematics---Alternative Version
- Computing A Glimpse of Randomness
- Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
- Scanning the structure of ill-known spaces: Part 1. Founding principles about mathematical constitution of space
- The Limits of Mathematics---Tutorial Version
- The Limits of Mathematics---Third Version
- On the Origin of Quantum Uncertainty
- Why we shouldn't fault Lucas and Penrose for continuing to believe in the Goedelian argument against computationalism
- Programs as the Language of Science