|
SEMINARS |
Kolmogorov seminar on computational complexity and descriptive complexity
|
|||
|
What we can compute given random strings as an oracle N. K. Vereshchagin |
|||
Abstract: In the talk we will discuss the result on computational power of the oracle of all random strings from the paper of E Allender, H Buhrman, M Koucky, D Melkebeek, D Ronneburger "Power from random strings". |