Incompleteness theorems for random reals (Q1105595): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gregory J. Chaitin / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Albert A. Mullin / rank
Normal rank
 
Property / author
 
Property / author: Gregory J. Chaitin / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Albert A. Mullin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0196-8858(87)90010-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001279301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic computation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gödel's theorem and information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for exponential diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5813263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Register machine proof of the theorem on exponential diophantine representation of enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5801644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank

Latest revision as of 17:04, 18 June 2024

scientific article
Language Label Description Also known as
English
Incompleteness theorems for random reals
scientific article

    Statements

    Incompleteness theorems for random reals (English)
    0 references
    1987
    0 references
    Using approaches from thermodynamics and information theory, the author shows several results in diophantine theory with stochastic proofs. Indeed, these ideas can be used to construct an exponential diophantine equation whose solutions are, in a very definite sense, random; e.g., in the sense of Martin-Löf. Many limitative theorems of logic follow from such results; e.g., modified incompleteness theorems of Gödel type. In the process, the author shows the equivalence of several different senses of random: (1) Martin-Löf; (2) Chaitin and (3) Solovay. The author seems to believe that God plays dice even with (pure) mathematics.
    0 references
    randomness
    0 references
    random reals
    0 references
    constructive mathematics
    0 references
    diophantine theory
    0 references
    stochastic proofs
    0 references
    exponential diophantine equation
    0 references
    modified incompleteness theorems of Gödel type
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references