Teacher
Answer a question with score of 1 or more.
earned this badge 1 time.
How can the simply typed lambda calculus be Turing-incomplete, yet stronger than second-order logic?
Awarded Jan 31, 2019 at 16:35