to my knowledge - they lack some of the things to make it a general purpose language. Presumebly they are refering to this: https://en.wikipedia.org/wiki/Turing_completeness . Whether that is a hindrance or not, I don't know, Traditional SQL is not touring complete https://stackoverflow.com/questions/900055/is-sql-or-even-tsql-turing-complete

they link to that page as well. And as you say... in what respect is that a hindrance. does that mean that there are certain problems you can't solve?

yes, some problems will not be solvable. but that might not be an issue for the domain in question

touring complete means you could write an OS with the language (in theory).

it claims to be a 100% declarative system, I assume that there are limitation to that at a certain point.

but not all languages are meant to be used that way

true, and this one certainly isn't.

yes, depending on what they implement - but they could always extend it

but what kind of problems can't be solved with a non-Turing complete system? Or does that depend on what specific things makes you non-Turing complete?

it depends on the specifics

marketing descriptions are not enough

very true

A feature of non-turing completeness is that there is a bunch of stuff it cannot do.

ie you can make some guarantees about bad stuff not happening.

https://cs.stackexchange.com/questions/110998/are-finite-automata-turing-complete could be interesting

The problem with Turing complete is that there are no limits to what can be computed.

@U0BKWMG5B had a great talk about the various degrees of power back in 2017 at Dutch Clojure Days

https://www.youtube.com/watch?v=zznwKCifC1A

One problem with Turing completeness is the halting problem: if you are Turing complete you cannot proof that your program will ever terminate.

Therefore things like Dhall exist, which are not Turing complete: > Dhall is not Turing-complete. Evaluation always terminates, no exceptions https://github.com/dhall-lang/dhall-lang

This is why Turing incompleteness is a feature ^

If that wasn't clear by now, yes :)

Isn't the halting problem solved for simply typed LC?

If it's turing complete you'd better use clojure anyways 😛

nice trailer