16 citations · 54 across the 28 of their papers we have counts for
Showing 2015 · math.LOShow all
2 papers · 2 filters
math.LO2015★ 2 cited
Generic algorithms for halting problem and optimal machines revisited
Laurent Bienvenu, Damien Desfontaines, Alexander Shen
The halting problem is undecidable --- but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their r…
math.LO2015★ 1 cited
Continuous higher randomness
Laurent Bienvenu, Noam Greenberg, Benoit Monin
We investigate the role of continuous reductions and continuous relativisation in the context of higher randomness. We define a higher analogue of Turing reducibility and show that…