DeepAI AI Chat
Log In Sign Up

Some Remarks on Real-Time Turing Machines

by   Holger Petersen, et al.

The power of real-time Turing machines using sublinear space is investigated. In contrast to a claim appearing in the literature, such machines can accept non-regular languages, even if working in deterministic mode. While maintaining a standard binary counter appears to be impossible in real-time, we present a guess and check approach that yields a binary representation of the input length. Based on this technique, we show that unary encodings of languages accepted in exponential time can be recognized by nondeterministic real-time Turing machines.


page 1

page 2

page 3

page 4


Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

The diagonalization technique was invented by Georg Cantor to show that ...

Python Type Hints are Turing Complete

Grigore showed that Java generics are Turing complete by describing a re...

Exploring Rulial Space: The Case of Turing Machines

As an example of the concept of rulial space, we explore the case of sim...

On the Power of Quantum Queue Automata in Real-time

This paper proposed a quantum analogue of classical queue automata by us...

A Log-Sensitive Encoding of Turing Machines in the λ-Calculus

This note modifies the reference encoding of Turing machines in the λ-ca...

Wadge Degrees of ω-Languages of Petri Nets

We prove that ω-languages of (non-deterministic) Petri nets and ω-langua...

User Friendly Line CAPTCHAs

CAPTCHAs or reverse Turing tests are real-time assessments used by progr...