79796393

Date: 2025-10-22 04:40:04
Score: 0.5
Natty:
Report link

I abstractly consider programming language built for configuration is not turing complete others are.

One can express

"Python programming language is turing complete for problems x which is decidable, for algorithm y exist.

"CSS is not turing complete for problems x, for algorithm y does not exist even the problem x is decidable"

There is a question "For every problem x does algorithm Y exist" is undecidable.

What problem is decidable or undecidable is proven by turing machine which is field of computability.

There for if some problem is decidable but cannot be solved with programming language then the programming language is not turing complete.

Computable function

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: meBe