Turing complete

A system is Turing complete if it can simulate any Turing machine, so it can compute anything that is algorithmically computable (Wikipedia, “Turing completeness”, read 2026-10-05; secondary source). The Church-Turing thesis says such systems are equivalent in what they can compute, whatever their implementation.

What it requires

• Conditional branching (if/else, jumps). Early mechanical calculators lacked it; Wikipedia cites ENIAC (1946) as the first practical computer with it.
• Repetition: loops or recursion.
• Unbounded memory in theory. Real machines have finite memory, so “Turing complete” in practice means “would be, given unlimited memory”; most programming languages qualify under that caveat.

Meaning for no-code and low-code platforms

If a no-code tool is Turing complete, any computable problem can in principle be built in it. This says nothing about practicality: performance, resource limits, maintainability and UI complexity still decide whether it is a good idea. Turing completeness also appears unintentionally: Wikipedia lists Microsoft Excel (via the LAMBDA function), Conway’s Game of Life, Minecraft, Magic: The Gathering and Unicode transliteration rules as examples.

Related: see the KB-AI/ai-automation/ notes for no-code and workflow-automation tools.

Sources

• https://en.wikipedia.org/wiki/Turing_completeness (accessed 2026-10-05, secondary)

Open items

• Primary sources (Turing 1936 paper) not consulted.