3 ms·
the halting problem applies to turing complete computations, which declarative computations are not.
by dustingetz 4y ago
the halting problem applies to turing complete computations, which declarative computations are not.
- lisper 4y agoHuh??? The Wikipedia article on declarative programming [1] lists functional programming as a sub-paradigm of declarative programming, and Haskell and Scheme as examples of functional languages. But Haskell and Scheme are obviously Turing-complete. So I have no idea what you are talking about. [1] https://en.wikipedia.org/wiki/Declarative_programming https://en.wikipedia.org/wiki/Declarative_programming