>Well, I believe the Nix expression language is Turing complete right (although I have no proof), so it is as powerful as any other general purpose language. It is obviously turing complete if you have arbitrarily large lists of strings. The proof is just direct translation of Turing machines into Nix language.