2 Oct 2015, the abstract was uploaded
Separation of randomness notions in Weihrauch degrees
Short talk on black boards at Dagstuhl Seminar
If someone says that a function is “computable”, it sometimes means that it is programmable with a programming language with a random generator. Computability with a random set can be paid more attension. In this talk we will consider whether we can make a random set more random. In other words, we will consider randomness notions in Weihrauch degrees and see some separation of them.
This is a joint work with Rupert Hölzl.