2 ms·
Isn't this a result of referential transparency, not Turing-incompleteness?
by mmirate 9y ago
Isn't this a result of referential transparency, not Turing-incompleteness?
- Gabriel439 9y agoBoth. In a Turing complete language there are programs without normal forms. For example, in the untyped lambda calculus you will loop forever if you try to normalize the following expression: (\x -> x x) (\x -> x x)