> Section 2.3 Turing Completeness and expressiveness: The primary requirement for a TC language is the capacity to describe unbounded computations over unbounded values. This encompasses a very wide spectrum of programming languages, if seemingly novel aspects are regarded as state changes, for example HTML manipulating WWW pages, and SQL manipulating databases.
>Contrariwise, a non-TC language can only describe bounded computations, for example regular expressions, or manipulate bounded values, for example FORTRAN IV which, without files, has bounded numbers and arrays. Arbitrary instances of an
arbitrary non-TC language will be translatable into an arbitrary TC language but not vice versa.
Can someone elaborate? How do we have unbounded computations and unbounded values?