Advertisement

Turing Completeness

  • Alex Reprintsev
Chapter

Abstract

Turing completeness is a very important notion in computer science because being Turing complete means that your model of computations can execute any algorithm no matter how complex it is, what data structures are used, and how much storage or time would be needed to evaluate it. SQL can be considered as yet another example of a model of computations and even though it's not supposed to be used to implement any algorithm or business logic, it's interesting to analyze whether it's Turing complete or not for the sake of completeness. Moreover, as will be shown in the next chapter "When PL/SQL Is Better Than Vanilla SQL," sometimes pure SQL is not the best way to get the result even if an algorithm can be easily implemented using it.

Copyright information

© Alex Reprintsev 2018

Authors and Affiliations

  • Alex Reprintsev
    • 1
  1. 1.LondonUK

Personalised recommendations