On read-once vs. multiple access to randomness in logspace

Noam Nisan*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

In the correct definition of randomized space-bounded computation, the machine has access to a random coin. The coin can be flipped at will, but outcomes of previous coin flips cannot be recalled unless they are saved in the machine's limited memory. In contrast to this read-once mechanism of accessing the random source, one may consider Turing machines which have access to a random tape. Here, the random bits may be multiply accessed by the machine. The author demonstrates a very concrete sense in which multiple access to the random bits is better than read-once access to them: Every language accepted with bounded two-sided error by a read-once-randomized logspace machine can be accepted with zero error by a randomized logspace machine having multiple access to the random bits.

Original languageAmerican English
Title of host publicationProc Fifth Annu Struct Complexity Theor
PublisherPubl by IEEE
Pages179-184
Number of pages6
ISBN (Print)0818620722
StatePublished - 1990
EventProceedings of the Fifth Annual Structure in Complexity Theory Conference - Barcelona, Spain
Duration: 8 Jul 199011 Jul 1990

Publication series

NameProc Fifth Annu Struct Complexity Theor

Conference

ConferenceProceedings of the Fifth Annual Structure in Complexity Theory Conference
CityBarcelona, Spain
Period8/07/9011/07/90

Fingerprint

Dive into the research topics of 'On read-once vs. multiple access to randomness in logspace'. Together they form a unique fingerprint.

Cite this