All people that say all programs are Turing complete, and therefore equivalent, need to be slapped.
https://link.springer.com/article/10.1007/s10817-021-09604-0
Also formal logics are picking up speed, due to being more democratic than conventional proofs and easier to collaborate on.
@zpartacoos It is similar to the people that think computer can't represent fractions accurately.
It is not a good upper bound in most cases. Not all constructive logics are equivalent, and the upper bound is not known.
@zpartacoos Yes, languages. The concept of representability is what matters, not computability.
By the formal defintion of computability, functions processable by a computer are only natural number functions. By representability, real number functions and more are processable by computers.