Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Limits on the Computational Power of Random Strings Eric Allender
 

Summary: Limits on the Computational Power of Random Strings
Eric Allender
Dept. of Computer Science
Rutgers University
New Brunswick, NJ 08855, USA
allender@cs.rutgers.edu
Luke Friedman
Dept. of Computer Science
Rutgers University
New Brunswick, NJ 08855, USA
lbfried@cs.rutgers.edu
William Gasarch
Dept. of Computer Science
University of Maryland
College Park, MD, 20742
gasarch@cs.umd.edu
June 20, 2011
Abstract
How powerful is the set of random strings? What can one say about a set A that is efficiently
reducible to R, the set of Kolmogorov-random strings? We present the first upper bound on the

  

Source: Allender, Eric - Department of Computer Science, Rutgers University

 

Collections: Computer Technologies and Information Sciences