Hacker News Reader

We can definitely have deterministic Turing-complete programs. Do you mean you want totality? I agree that's nice, but in practice, being free from side-effects is likely more important than ensuring the program halts.

Turing-completeness, determinism, and crash safety are three independent properties; a given language may have any 0, 1, 2, or 3 of them.

usually, a freeze is considered a crash too. In this sense, you cannot be turing complete and crash safe.

You can be turing complete without meaningful freezes. You can be non turing complete with meaningful freezes.

this is something I often hear about both configuration and validation languages - but why? You evidently are ok with loading programs that may or many not crash your computer? So crashing problems happen at the configuration step first.

Turing complete applications need that degree of complexity, but configuration is meant to describe a state - it's just data.

Unless it's CloudFormation... Then it's just data stuffed with functions that do a bunch of string manipulation.