Given a computable sequence of natural numbers, it is a natural task to ...
Matthias Schröder has asked the question whether there is a weakest
disc...
We systematically study the completion of choice problems in the Weihrau...
We prove that the Weihrauch lattice can be transformed into a Brouwer al...
Limit computable functions can be characterized by Turing jumps on the i...