Running Time of Composition Quiz – GT – Computability, Complexity, Theory: Complexity
Articles Blog

Running Time of Composition Quiz – GT – Computability, Complexity, Theory: Complexity

August 23, 2019


We just found ourselves considering
the running time of the composition of two turning machines. Think carefully, and give the most
appropriate bound for the running time of the composition of m, which runs in
time q with N, which runs in time p. You can assume that both N and
M read all of their input

Leave a Reply

Your email address will not be published. Required fields are marked *