6533b851fe1ef96bd12a8bac
RESEARCH PRODUCT
Minimal nontrivial space complexity of probabilistic one- way turing machines
Janis KanepsRusins Freivaldssubject
Discrete mathematicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESSuper-recursive algorithmProbabilistic Turing machineLinear speedup theoremNSPACEDescription numberCombinatoricsTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESNon-deterministic Turing machinesymbolsTime hierarchy theoremComputer Science::Formal Languages and Automata TheoryMathematicsdescription
Languages recognizable in o(log log n) space by probabilistic one — way Turing machines are proved to be regular. This solves an open problem in [4].
year | journal | country | edition | language |
---|---|---|---|---|
2005-12-01 |