Probabilistic Recursive Functions

DOI10.2307/1996608zbMath0267.02030OpenAlexW4232007613MaRDI QIDQ5685067

Irwin Mann

Publication date: 1973

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

Mathematics Subject Classification ID

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

Related Items (1)

Layerwise computability and image randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Unsolvable Problem of Elementary Number Theory
• Nicht konstruktiv beweisbare Sätze der Analysis
• Arithmetical definability of field elements
• Criteria of constructibility for real numbers
• Recursive Real Numbers

This page was built for publication: Probabilistic Recursive Functions