Probabilistic Recursive Functions

DOI10.2307/1996608MaRDI QIDQ5685067zbMATH OpenOpenAlexFDO

Authors Irwin Mann

Publication date 1973

Full work available at URL https://doi.org/10.2307/1996608

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Proof theory and constructive mathematics (03F99) Probability measures on topological spaces (60B05) Continuity and singularity of induced measures (60G30) Monte Carlo methods (65C05) Algorithms in computer science (68W99)

Cites work

• An Unsolvable Problem of Elementary Number Theory
• Arithmetical definability of field elements
• Criteria of constructibility for real numbers
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3060775 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Nicht konstruktiv beweisbare Sätze der Analysis
• Recursive Real Numbers

Cited in

(1)

• Layerwise computability and image randomness

This page was built for publication: Probabilistic Recursive Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5685067)