Skip to search formSkip to main contentSkip to account menu

Alternating Turing machine

Known as: Alternating computation, Existential state, Alternation 
In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We present a unified picture for the evolution of star clusters on the two-body relaxation timescale. We use direct N-body… 
2009
2009
The torsional deformation properties of a TiNi shape-memory alloy thin strip were investigated. The results obtained are… 
2005
2005
In multiconverter topology, several voltage-source pulsewidth modulation (PWM) inverters using common sinusoidal modulating… 
Highly Cited
1997
Highly Cited
1997
Several types of network traffic have been shown to exhibit long-range dependence (LRD). In this work, we show that the busy… 
1997
1997
  • Martin Klazar
  • 1997
  • Corpus ID: 12409419
The quantity N5(n) is the maximum length of a finite sequence over n symbols which has no two identical consecutive elements and… 
1997
1997
The paper presents a language of update programs that integrates logical queries, bulk updates and hypothetical reasoning in a… 
1996
1996
When multimedia information including speech, image, data etc. are transmitted, the difference in information rates, required… 
1993
1993
The internal charge versus phosphor field (Q–Fp) technique is proposed as a method for characterization of the electrical… 
1993
1993
Connectionless (CL) services as already developed in LANs, have to interwork with emerging asynchronous transfer mode (ATM… 
1990
1990
Alternating Turing machines (ATMs) with bounded number of reversals are considered. It is proved that the machines making fewer…