I have only a few things left to say, and then you may have the last word.

• My mention of Turing machines was ill-considered, as I have already admitted
• Turing machines are interesting because:
  • They are powerful enough to be widely applicable
  • They are simple and easy to think about
  • They are not very much different from a machine that could actually be constructed
• Computability and complexity of algorithms are inextricably connected
• Any reasonably competent programmer can code a finite tape Turing machine in a matter of minutes
• Anticipitating your probable response to the above, imagine that I hand you a black box which I claim contains a Turing machine. Without opening the box, what kind of "Turing test" would you put it through to determine whether it contains a "real" Turing machine or a simulation of one using a general-purpose computer?