mikejuk writes: After security by obscurity we now have security by computer science! The idea explained at this year's 28th Chaos Computer Congress (28C3) by Meredith Patterson was simply that, if you build input languages and protocols that are too powerful, from the point of view of grammar, then you deserve all you get. If a protocol is Turing-complete then recognizing valid input is formally undecidable. Only by reducing the sophistication to context free or regular grammars can we protect against "creative" uses of software. See the video of the presentation — you wont be bored.