The Typical Constructible Object

DOI10.1007/978-3-319-40189-8_12zbMath1476.03055OpenAlexW2490130906MaRDI QIDQ3188247

Mathieu Hoyrup

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01396167/file/genericity.pdf

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Recursively (computably) enumerable sets and degrees (03D25) Classification of real functions; Baire classification of sets and functions (26A21) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• On the uniform computational content of computability theory
• Applications of the Baire category theorem
• Genericity of weakly computable objects
• A new constructive version of Baire's theorem
• The upper semi-lattice of degrees of recursive unsolvability
• The Baire category theorem in weak subsystems of second-order arithmetic
• Effective fractal dimensions
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Category and Measure in Complexity Classes
• Simple Proofs of Some Theorems on High Degrees of Unsolvability
• Computability and Randomness

This page was built for publication: The Typical Constructible Object