🚀 go-pugleaf

Many programming languages (some would say all) are "Turing
Equivalent". That is, anything you can do with a Turing Machine, you
can express with such a programming language. Many programs do not do all
that they are cabable of on a real machine because they run out of
memory, i.e. hit the limitations of the machine.

REAL machines today, and probably ever, cannot run all possible programs
written in a Turing Equivalent Language without restricting them in
some way (i.e., a failed malloc call).

One reason for using a turing equivalent language that may run out of
memory on a given machine, is to have a large degree of machine
independence, generally considered a valuable thing, which can use
whatever resources that exist when it is running.

Is the halting problem solvable then? Not for a program in such a
language, but for a program in that language on a given machine.
However, on a given machine, the program has "finite" power, and it is
not "The Halting Problem" anymore.

IMHO

Dan
--
Daniel Mark Gessel
Internet: gessel@cs.swarthmore.edu
I do not speak (nor type) representing Swarthmore College.