What are the practical limitations of a non-turing complete language like Coq?

Question

As there are non-Turing complete languages out there, and given I didn\'t study Comp Sci at university, could someone explain something that a Turing-incomplete language (like C

Answer 1

You can't write a function that simulates a Turing machine. You can write a function that simulates a Turing machine for 2^128 (or 2^2^2^2^128 steps) and reports whether the Turing machine accepted, rejected, or ran for longer than the allowed number of steps.

Since "in practice" you will be long gone before your computer can simulate a Turing machine for 2^128 steps, it's fair to say that Turing incompleteness does not make much of a difference "in practice".