Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q220283 |
||
| Property / reviewed by | |||
| Property / reviewed by: Q792453 / rank | |||
Revision as of 23:37, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) |
scientific article |
Statements
Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (English)
0 references
26 June 1992
0 references
The main result of the paper consists in the following: there are strong differences in the computational power of deterministic, nondeterministic, co-nondeterministic and alternating eraser Turing machines. The technique of the proof is based on exponential lower and polynomial upper bounds for read-once-only \(\Omega\)- branching programs.
0 references
Turing machines
0 references
branching programs
0 references
