Seminars: N. K. Vereshchagin, What we can compute given random strings as an oracle

Seminars

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	Calendar
	Search
	Add a seminar

	RSS
	Forthcoming seminars

Kolmogorov seminar on computational complexity and descriptive complexity
April 28, 2012 16:45–18:20, Moscow

What we can compute given random strings as an oracle

N. K. Vereshchagin

Number of views:
This page:	184

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".

Registration to the website

Logotypes