scientific article; zbMATH DE number 3319549
From MaRDI portal
Publication:5599173
zbMath0201.33404MaRDI QIDQ5599173
Publication date: 1964
Full work available at URL: https://eudml.org/doc/186625
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
On the bit complexity of distributed computations in a ring with a leader ⋮ Weight-reducing Turing machines ⋮ Affine mappings defined by finite transducers ⋮ An NP-complete language accepted in linear time by a one-tape Turing machine ⋮ Verifying time complexity of Turing machines ⋮ Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time ⋮ The halting problem for linear Turing assemblers ⋮ From Logic to Theoretical Computer Science – An Update ⋮ A Hierarchy of Fast Reversible Turing Machines ⋮ Reductions in circuit complexity: An isomorphism theorem and a gap theorem ⋮ For completeness, sublogarithmic space is no space. ⋮ Deterministic Turing machines in the range between real-time and linear-time. ⋮ Converting nondeterministic two-way automata into small deterministic linear-time machines
This page was built for publication:
