Re:1931: Kurt Gödel shows limits of math, logic, computing, AI
by sn41 on Tuesday June 22, 2021 @08:34AM
(#27590861)
It's an honor to receive a response from you. I agree on all points, especially the lack of combinators for strongly typed systems. (As I understand it, it is impossible to assign types to such terms.) My main point was that disrespect for Turing's paper is largely unjustified.
halting problem before [Turing 1936], which was written up
in a hurry after [Church 1935].
The Y-combinator does not work for strongly-typed systems.
Instead recursion must be explicitly added as an additional
primitive to the lambda calculus.
See following for more information:
https://papers.ssrn.com/abstract=3418003