Nondeterministic stack register machines

DOI10.1016/S0304-3975(96)00051-5zbMath0901.68052MaRDI QIDQ1391527

Peter Clote

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

stack register machine

Mathematics Subject Classification ID

Related Items (6)

1998 European Summer Meeting of the Association for Symbolic Logic ⋮ Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\) ⋮ Computation models and function algebras ⋮ Arithmetization of register machines with counters ⋮ Counting modulo finite semigroups ⋮ Nonerasing, counting, and majority over the linear time hierarchy

Cites Work

• On the scheme of induction for bounded arithmetic formulas
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Logical number theory I. An introduction
• Complete sets and the polynomial-time hierarchy
• Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\)
• Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität
• Classes of Predictably Computable Functions
• A taxonomy of problems with fast parallel algorithms
• Alternation
• PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS
• Expectations for Inbreeding Depression on Self-Fertilization of Tetraploids
• Expressibility and Parallel Complexity
• Turing machines and the spectra of first-order formulas
• Subrecursiveness: Machine-independent notions of computability in restricted time and storage
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nondeterministic stack register machines