Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Feasible reductions to Kolmogorov-Loveland stochastic sequences
Autore:
Lutz, JH; Schweizer, DL;
Indirizzi:
Iowa State Univ, Dept Comp Sci, Ames, IA 50011 USA Iowa State Univ Ames IA USA 50011 Univ, Dept Comp Sci, Ames, IA 50011 USA Barclays Global Investors, San Francisco, CA 94105 USA Barclays Global Investors San Francisco CA USA 94105 ncisco, CA 94105 USA
Titolo Testata:
THEORETICAL COMPUTER SCIENCE
fascicolo: 1-2, volume: 225, anno: 1999,
pagine: 185 - 194
SICI:
0304-3975(19990828)225:1-2<185:FRTKSS>2.0.ZU;2-5
Fonte:
ISI
Lingua:
ENG
Soggetto:
INFORMATION-THEORY; COMPLEXITY;
Keywords:
algorithmically random sequences; foundations of randomness; Kolmogorov-Loveland stochasticity; polynomial-lime reductions;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
31
Recensione:
Indirizzi per estratti:
Indirizzo: Lutz, JH Iowa State Univ, Dept Comp Sci, 226 Atanasoff Hall, Ames, IA 50011 USA Iowa State Univ 226 Atanasoff Hall Ames IA USA 50011 IA 50011 USA
Citazione:
J.H. Lutz e D.L. Schweizer, "Feasible reductions to Kolmogorov-Loveland stochastic sequences", THEOR COMP, 225(1-2), 1999, pp. 185-194

Abstract

For every binary sequence A, there is an infinite binary sequence S such that A less than or equal to(tt)(P)S and S is stochastic in the sense of Kolmogorov and Loveland. (C) 1999 Elsevier Science B.V. All rights reserved.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 11/07/20 alle ore 17:22:45