Still trivially false. Turing machines and the lambda calculus can both enumerat...

		naasking on Dec 18, 2023 \| parent \| context \| favorite \| on: Weak-to-Strong Generalization Still trivially false. Turing machines and the lambda calculus can both enumerate all recursively enumerable functions. And infinity of complexity from simple formalism .