In order to be Turing-complete, Sass would have to have some way of reading and writing arbitrary amounts of memory. Since it has neither anonymous functions no

In order to be Turing-complete, Sass would have to have some way of reading and writing arbitrary amounts of memory. Since it has neither anonymous functions nor any sort of data structures, it can only read and write from pre-declared variables.