Genericity of weakly computable objects

DOI10.1007/S00224-016-9737-6zbMath1366.68056OpenAlexW2559927126MaRDI QIDQ2363959

Mathieu Hoyrup

Publication date: 17 July 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01095864/file/revision.pdf

zbMATH Keywords

priority methodgenericirreversible functioncomputable

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computation over the reals, computable analysis (03D78)

Related Items (5)

The Typical Constructible Object ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the category of ergodic measures
• Effective properties of sets and functions in metric spaces with computability structure
• Presentations of computably enumerable reals.
• Randomness and reducibility
• Weihrauch degrees, omniscience principles and weak computability
• Randomness and the Ergodic Decomposition
• Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
• Degrees of unsolvability of continuous functions
• Arithmetical Reducibilities I
• New Computational Paradigms
• Topologies on Spaces of Subsets
• Lectures on Choquet's theorem

This page was built for publication: Genericity of weakly computable objects