You are correct, but you are probably being downvoted because it is difficult to relate to your point of view.<p>How many “sub-Turing-complete” languages can you list?<p>Note “sub-Turing-complete” may not be the right term to use for all languages that do not admit general recursion.  There is a particularly interesting subset of total languages for which the preferred term is “languages with control over non-termination”.<p><a href="http:&#x2F;&#x2F;www.cse.chalmers.se&#x2F;~nad&#x2F;publications&#x2F;danielsson-semantics-partiality-monad.pdf" rel="nofollow">http:&#x2F;&#x2F;www.cse.chalmers.se&#x2F;~nad&#x2F;publications&#x2F;danielsson-sema...</a><p><a href="https:&#x2F;&#x2F;personal.cis.strath.ac.uk&#x2F;conor.mcbride&#x2F;TotallyFree.pdf" rel="nofollow">https:&#x2F;&#x2F;personal.cis.strath.ac.uk&#x2F;conor.mcbride&#x2F;TotallyFree....</a><p><a href="https:&#x2F;&#x2F;github.com&#x2F;mietek&#x2F;total-functional-programming" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;mietek&#x2F;total-functional-programming</a>