This page is not created by, affiliated with, or supported by Slack Technologies, Inc.

## 2022-04-12

## Channels

- # announcements (76)
- # babashka (10)
- # beginners (39)
- # biff (2)
- # calva (51)
- # chlorine-clover (8)
- # cider (6)
- # clj-kondo (15)
- # clj-on-windows (13)
- # cljdoc (26)
- # cljs-dev (8)
- # clojure (196)
- # clojure-austin (17)
- # clojure-europe (36)
- # clojure-nl (4)
- # clojure-spec (8)
- # clojure-uk (2)
- # clojurescript (18)
- # community-development (4)
- # conjure (1)
- # core-typed (38)
- # cursive (5)
- # datalevin (17)
- # datomic (21)
- # docker (1)
- # events (2)
- # interop (2)
- # jobs (4)
- # kaocha (28)
- # lsp (22)
- # nyc (1)
- # off-topic (10)
- # pedestal (1)
- # portal (22)
- # re-frame (22)
- # react (10)
- # shadow-cljs (19)
- # spacemacs (7)
- # tools-deps (11)
- # vim (14)
- # xtdb (7)

Good morning

Good morning. Trying to figure out if I can visit :clojureD in June. Wish me luck!

So I just got information about a potential competitor... and they claim that the technology they use is *not* Turing complete. Now that doesn't sound good... but what does that actually mean?

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

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

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?

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

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

Good morning!

Sunny Morning from Annecy lake! 🌅 First time but not last...very nice place!