> You are aware of <http://en.wikipedia.org/wiki/Halting_problem>, yes?
Perfectly aware of it. Naively stated as equivelent for a reason.
If dealing with halting type problems was actually impossible, it
would be unreasonable to expect that my C compiler could compile the
utterance:
while(1) {}
in finite time. We are obviously not in such a universe.
Any kind of semantic hacking in a turing complete language has
problems with turing completeness; fix point combinator hacking within
specific domains is a known difficult thing.
The question is one of making domains more and more generic. As
we ask for a single domain, and the domain is generic, we make our
problem taller and taller. The fixpoint combinator of the domain of
domains is equated to the manhattan project by at least one really
smart person on earth.
None of why I ask this is idle speculation. I see traction on
hard problems, provided we put our heads together. Finding Marc here
and thinking in about the right way is worth the price of admission.
_______________________________________________
lssconf-discuss mailing list
lssconf-discuss@inf.ed.ac.uk
http://lists.inf.ed.ac.uk/mailman/listinfo/lssconf-discuss
