The following pages link to (Q5599173):
Displayed 13 items.
- Verifying time complexity of Turing machines (Q496007) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577) (← links)
- Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time (Q1193594) (← links)
- The halting problem for linear Turing assemblers (Q1231906) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- For completeness, sublogarithmic space is no space. (Q1853022) (← links)
- Deterministic Turing machines in the range between real-time and linear-time. (Q1853527) (← links)
- Affine mappings defined by finite transducers (Q1968571) (← links)
- Converting nondeterministic two-way automata into small deterministic linear-time machines (Q2105419) (← links)
- A Hierarchy of Fast Reversible Turing Machines (Q2822488) (← links)
- From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
- Weight-reducing Turing machines (Q6040666) (← links)