Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Kautz:1998:IZO,
author = "Steven M. Kautz",
title = "An improved zero-one law for algorithmically random
sequences",
journal = j-THEOR-COMP-SCI,
volume = "191",
number = "1--2",
pages = "185--192",
day = "30",
month = jan,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=191&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2652.pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity)",
corpsource = "Dept. of Math., Randolph-Macon Woman's Coll.,
Lynchburg, VA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithmically random sequences; complexity;
computational complexity; random oracles; reducibility;
sequences; zero-one law",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}