Everything is expressible in a Turing-complete procedural language. It's not always expressive, though. Sometimes you can gain expressiveness by removing power, creating a domain-specific language or DSL for the kind of problem you want to solve.
Maybe this is the term you are looking for? SQL without extensions is not Turing-complete, so as you note, only a subset of the possible programs of a Turing-complete language can be transformed.
Everything is expressible in a Turing-complete procedural language. It's not always expressive, though. Sometimes you can gain expressiveness by removing power, creating a domain-specific language, or DSL, for the kind of problem you want to solve.
Maybe this is the term you are looking for? SQL without extensions is not Turing-complete, so as you note, only a subset of the possible programs of a Turing-complete language can be transformed.
WP:Transact-SQL "Transact-SQL augments SQL with certain additional features .. . These additional features make Transact-SQL Turing complete. " – clacke Jul 31 '10 at 9:13 nevermind it got edited out: en.wikipedia.
Org/w/… – Earlz Jul 31 '10 at 17:21.
I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.