Sunday 18 October 2026 09:47:16 GMT+02:00

Netcrook

HomeManifesto
News
Techcrook
Geocrook
WikicrookTeamAppContact
EnglishItaliano

WIKICROOK

Turing complete

A system able to express any computation in principle.

Turing complete describes a system that can express any computation in principle, given enough time and memory. The term does not mean the system is practical, fast, or safe; it means its rules are powerful enough to model general-purpose programming.

In cyber security, this matters because seemingly narrow features can become full logic engines. Regular-expression engines, template languages, macro systems, and configuration formats may be more expressive than they first appear. Attackers can abuse that power to hide payload logic, build complex parser exploits, or turn trusted text-processing features into code execution paths. Defenders need to review these systems carefully, because a “simple” pattern or rule may actually contain branching behavior, loops, and side effects. The key lesson is that expressiveness creates risk: if a tool can compute, it deserves the same scrutiny as code.

← WIKICROOK index