Mathematics as information compression via the matching and unification of patterns

DOI10.1155/2019/6427493zbMath1432.00027arXiv1808.07004OpenAlexW2993762697MaRDI QIDQ2281995

J. Gerard Wolff

Publication date: 6 January 2020

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.07004

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Information theory (general) (94A15) General topics in artificial intelligence (68T01)

Uses Software

• Simula 67

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discovery of algorithmic probability
• Philosophy of Mathematics
• The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
• A Theory of Program Size Formally Identical to Information Theory
• Algorithmic Information Theory
• Elements of Information Theory
• Logical basis for information theory and probability theory
• A formal theory of inductive inference. Part II
• Formal Reductions of the General Combinatorial Decision Problem
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Mathematics as information compression via the matching and unification of patterns