Publication:5599173
From MaRDI portal
zbMath0201.33404MaRDI QIDQ5599173
Publication date: 1964
Full work available at URL: https://eudml.org/doc/186625
Related Items
From Logic to Theoretical Computer Science – An Update, Weight-reducing Turing machines, Verifying time complexity of Turing machines, On the bit complexity of distributed computations in a ring with a leader, An NP-complete language accepted in linear time by a one-tape Turing machine, Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time, The halting problem for linear Turing assemblers, 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., Affine mappings defined by finite transducers, Converting nondeterministic two-way automata into small deterministic linear-time machines, A Hierarchy of Fast Reversible Turing Machines