Honors Theory of Computation, Spring'99
Homework 1
-- DATE DUE: Feb 1, 1999
-- PROBLEMS:
-
Show how any Turing machine in the fundamental
mode can be simulated by a pointer machine in
the fundamental mode in such a way that time
and space complexity are related by constant factors.
You will need to establish some reasonable conventions
for this correspondence.
-
Show how any pointer machine in the fundamental mode
can be simulated by a Turing machine
in the fundamental mode.
You need to make this simulation as ``efficient''
as possible in terms of time and space complexity.