Question: [21] Fix a reference universal reversible Turing machine, say UR0. Define Et 3(x, y) = min{l(p) + l(q) : UR0( p, x ) = q,
[21] Fix a reference universal reversible Turing machine, say UR0. Define Et 3(x, y) = min{l(p) + l(q) : UR0(p, x ) = q, y in t(n)
steps of computation, where n = l(x)}. Show that for every computable function t there is an x such that Et 3(x, ) > E3(x, ).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
