LISP program-size complexity. II
From MaRDI portal
Publication:1200219
Recommendations
Cites work
- Gödel's theorem and information
- scientific article; zbMATH DE number 412253 (Why is no real title available?)
- scientific article; zbMATH DE number 44959 (Why is no real title available?)
- scientific article; zbMATH DE number 53705 (Why is no real title available?)
- scientific article; zbMATH DE number 976355 (Why is no real title available?)
- Information-Theoretic Incompleteness
- Information-Theoretic Limitations of Formal Systems
- LISP program-size complexity
- Proof of Recursive Unsolvability of Hilbert's Tenth Problem
- RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets
Cited in
(6)- LISP program-size complexity. III
- LISP program-size complexity. IV
- Is complexity a source of incompleteness?
- A program-size complexity measure for mathematical problems and conjectures
- scientific article; zbMATH DE number 1342342 (Why is no real title available?)
- Natural halting probabilities, partial randomness, and zeta functions
This page was built for publication: LISP program-size complexity. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200219)