What can you do in LISP that you can't do in Python

[Michael Hudson]

ssthapa at classes.cs.uchicago.edu () writes:

>     Actually, I don't think this is quite true.  I believe this
> holds only if the Church-Turing Thesis is true.  The original
> Church-Turing thesis basically states that every effective
> calculation can be done by a Turing machine.

Can you come up with a sensible definition of computability that isn't
"what can be computed by a turing machine?" (or one of its equivalents
such as universal register machines or diophantine equations).

Cheers,
M.

-- 
  While preceding your entrance with a grenade is a good tactic in
  Quake, it can lead to problems if attempted at work.    -- C Hacking
               -- http://home.xnet.com/~raven/Sysadmin/ASR.Quotes.html