101 citations · 491 across the 53 of their papers we have counts for
Showing 2009 · cs.LOShow all
2 papers · 2 filters
cs.LO2009★ 11 cited
Infinite Oracle Queries in Type-2 Machines (Extended Abstract)
Arno Pauly
We define Oracle-Type-2-Machine capable of writing infinite oracle queries. In contrast to finite oracle queries, this extends the realm of oracle-computable functions into the dis…
cs.LO2009★ 32 cited
On the (semi)lattices induced by continuous reducibilities
Arno Pauly
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the orde…