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’s, 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 ...
© Alex Reprintsev 2018
Alex ReprintsevOracle SQL Revealedhttps://doi.org/10.1007/978-1-4842-3372-6_1010. Turing Completeness
Alex Reprintsev1
(1)
London, UK
Get Oracle SQL Revealed: Executing Business Logic in the Database Engine now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
