Explore a conference talk that delves into the Turing completeness of Ansible, a popular configuration management language. Discover how the speakers, Ruben Opdebeeck and Coen De Roover, demonstrate that Ansible achieves Turing completeness using only a small subset of its core language features. Learn about the concept of accidental Turing completeness in various systems and languages, including C++ templates and Cities: Skylines. Examine the potential paths to Turing completeness in Ansible, such as plugins and the Jinja2 templating language, before focusing on the core Ansible language itself. Gain insights into the structure of the presentation and its exploration of Ansible's unexpected computational power in this 23-minute talk from the ACM SIGPLAN conference.
Overview
Syllabus
[CONFLANG23] Ansible Is Turing Complete
Taught by
ACM SIGPLAN