Posted by on September 11, 2014

I’ve seen some wonderful, powerful, and creative T-SQL Common Table Expression (CTE) SQL statements recently. Our tools have been improved, and we’re eagerly exploring them. Recursive CTEs make individual SQL statements Turing Complete [Proof]. By analogy, that SQL is Turing complete means that it is a hammer that works on not only nails, but also screws, nuts, and everything else too.

There is some really solid theory, called Turing Equivalence, which says that all languages that are complete are the same. Thankfully, everyone understands that practically programming doesn’t work that way. If two tools can do the same task, our job as professionals is to pick the best tool for the job.

Read the rest on the Optimal BI blog.

Posted in: Technical


Be the first to comment.

Leave a Reply