A computability structure on a metric space is a set of sequences which satisfy certain conditions. Of a particular interest are those computability structures which contain a dense sequence, so ...

Algorithmic randomness and computability theory inhabit a crossroads between mathematics and computer science, providing a rigorous framework for understanding randomness in infinite sequences and ...

Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

We show that to every recursive total continuous functional Φ there is a PCF-definable representative Ψ of Φ in the hierarchy of partial continuous functionals, where PCF is Plotkin's programming ...