Genericity of weakly computable objects - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theory of Computing Systems Year : 2017

Genericity of weakly computable objects


In computability theory many results state the existence of objects that in many respects lack algorithmic structure but at the same time are effective in some sense. Friedberg and Muchnik's answer to Post problem is one of the most celebrated results in this form. The main goal of the paper is to develop a general result that embodies a large number of these particular constructions, capturing the essential idea that is common to all of them, and expressing it in topological terms. To do so, we introduce the effective topological notions of irreversible function and directional genericity and provide two main results that identify situations when such constructions are possible, clarifying the role of topology in many arguments from computability theory. We apply these abstract results to particular situations, illustrating their strength and deriving new results.This paper is an extended version of a conference paper with detailed proofs and new results.
Fichier principal
Vignette du fichier
revision.pdf (344.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01095864 , version 1 (16-12-2014)
hal-01095864 , version 2 (09-12-2016)



Mathieu Hoyrup. Genericity of weakly computable objects. Theory of Computing Systems, 2017, Special Issue: Theoretical Aspects of Computer Science, 60 (3), ⟨10.1007/s00224-016-9737-6⟩. ⟨hal-01095864v2⟩
157 View
224 Download



Gmail Facebook X LinkedIn More