Follow
RT @CompSciFact
Turing-machines and λ-calculus are equivalent only w.r.t. the functions they can define. Maybe not complexity. https://cstheory.stackexchange.com/questions/23798/p-and-np-classes-explanation-through-lambda-calculus
