This preview shows page 1. Sign up to view the full content.
Unformatted text preview: we can have one by erasing all tapes and reset all tapeheads when we accept. Then we do closure by rounds. In every round, we check for each configuration if it leads to a configuration marked as eventually accepting", and mark it if that is the case. We will need at most 2 )) ( ( n s O rounds to complete the closure, each taking time 2 O(S(n)) . The total time is thus 2 )) ( ( n s O . 2 )) ( ( n s O =2 )) ( ( n s O------------- We know that DTIME(T(n)) U L-SIZE(O(T(n) 2 )). So it is enough to show that U L-SIZE(O(T(n) 2 )) ASPACE(log T(n)) That is given a machine M that outputs a circuit of size O(T(n) 2 ) in O(log T(n)) space, we must construct a ATM that evaluates the circuit in only O(log(T(n))) space.------ Combining  and  we get, ASPACE(S(n)) = DTIME(2 )) ( ( n s O )...
View Full Document
This note was uploaded on 05/02/2010 for the course COMPUTER S csci 5403 taught by Professor Hooper during the Spring '10 term at University of Minnesota Crookston.
- Spring '10