Define a "ram turing machine" to be a turing machine that has random access memory. Weformalize this as follows: the machine has an infinite array a that is initialized to all blanks.
Answers
Explanation:
Define a RAM Turing machine to be a Turing machine that has random access memory. We formalize this as follows: The machine has an infinite array A that is initialized to all blanks. It accesses this array as follows. One of the machine's work tapes is designated as the address tape. Also the machine has two special alphabet symbols denoted by R and W and an additional state we denote by q_access. Whenever the machine enters q_access, if its address tape contains 'i'R (where 'i' denotes the binary representation of i) then the value A[i] is written in the cell next to the R symbol. If its tape contains 'i'Wa (where a is some symbol in the machine's alphabet) then A[i] is set to the value a.
Show that if a Boolean function f is computable within time T(n) (for some time constructible T) by a RAM TM, then is is in DTIME(T(n)2).