> There are no Turing machines.  Real computers are finite, and real
> source codes are finite.  I'm sure that if you set a limit on the
> length of the source code which is recognized by the supposed trap, a
> sufficiently large FSM can decide in a finite time whether there's a
> trap.

mere finiteness doesn't help much in practice if you're up against
algorithms which take time exponential in some parameter (like the
size of the 'trap' region) which is likely to get even moderately
sized..

                                                - Bill

Reply via email to