Nicolas Seriot explains that variable slicing and recursive configuration includes in curl 8.12–8.16 can simulate a two-counter Minsky machine. String lengths represent counters, while selecting the next configuration file implements incrementing, decrementing and conditional branches. Turing completeness assumes unlimited resources; actual execution is constrained by string size, stack space and memory. The official change record supports the introduction of a five-level include-depth limit in the 8.17 series to stop self-recursion. This is an analysis of the expressive power of combined features, not a reported security vulnerability.
Back to Tech
An analysis finds Turing-complete behavior in curl 8.12–8.16 configurations
Simple variables and configuration includes can form a computation model, but finite resources and security impact are separate questions.