ScholarLens Back to search
2014•Russian MathematicsRequires access

Computational power of one-way turing machines with sublogarithmic memory restrictions

A. N. Leshchev

Open publisher page 0 citations

Abstract

This paper considers the well-known Turing machine model, the nondeterministic real-time Turing machine. The author proves the existence of nonregular complexity classes of languages that can be recognized by nondeterministic one-way Turing machines with sublogarithmic memory restrictions. And these complexity classes form a strict hierarchy. The author defines a special language family and shows its properties to prove that hierarchy.

About this research paper

What this paper is about

This paper considers the well-known Turing machine model, the nondeterministic real-time Turing machine. The author proves the existence of nonregular complexity classes of languages that can be recognized by nondeterministic one-way Turing machines with sublogarithmic memory restrictions. And these complexity classes form a strict hierarchy. The author defines a special language family and shows its properties to prove that hierarchy.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper considers the well-known Turing machine model, the nondeterministic real-time Turing machine. The author proves the existence of nonregular complexity classes of languages that can be recognized by nondeterministic one-way Turing machines with sublogarithmic memory restrictions. And these complexity classes form a strict hierarchy. The author defines a special language family and shows its properties to prove that hierarchy.

Key concepts: Time hierarchy theorem, NSPACE, Turing machine, Super-recursive algorithm, DTIME, Nondeterministic algorithm, Description number, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Computational power of one-way turing machines with sublogarithmic memory restrictions — Research Paper | ScholarLens