This is an old revision of the document!
Reading Rice's Theorem
Establish the hardness of the following
- $ f(M_1,M_2) = \left\{\begin{array}{ll} 1 & M_1 \text{ takes as much time as } M_2 \text{ on every input } \\ 0 & \text{otherwise} \end{array}\right.$