1:14:50 i have been thinking about this question for days which is related to pset2 #4 [projection of decidable iff T-recognizable].How can we be sure that proofs itself doesn't cause looping.In the sense of projection problem How can i be sure that recognizable T is trying new inputs and not wasting its time with a pointless circles in specific pair of (x,y)####[['T', 'Mathematical_Related_Concept', 'NEU'], ['[projection of decidable iff T-recognizable]', 'Mathematical_Related_Concept', 'NEU']]