MFCS
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we consider the question of whether NC0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show • Generators compu...
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract Marek Chrobak1 , Lawrence L. Larmore2 , and Wojciech Rytter3,4 1 Department of Computer Science, University of California Riverside, CA 92521 2 Department of Computer Scie...
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...