[Verdex_3]

There is a series of talks by Yuri Gurevich on Channel 9 where he talks about algorithms. While I haven't watched this particular video (yet), I did watch the other series a few times (3 videos IIRC). Anyway, in those videos Yuri seems to basically be saying that he doesn't think all algorithms from now to eternity will always be representable with turing machines. Which seems a bit more reasonable than the title here (Church-Turing cannot be true). It's a different way of saying when an old scientist says something is possible he's probably right and if he says something is impossible then he's probably wrong (only inverted ... ie saying church turing will never be irrelevant is hedging your bets against human progress).

All that being said, I don't buy what Yuri is selling. Even quantum computing can be simulated with a classical computer (with exponential slowdown), so I'm not seeing what's going to turn out to be more fundamental at least in a theoretical sense. Practically people might not care (yes technically you can simulate that graphics card in lambda calculus, but practically you would never do that and the guys building these things probably don't care about the church turing thesis), but the effective computability definition feels pretty effective. Either way, I'm not going to loose too much sleep over it. At the end of the day I'm more interested in looking for ways to be more effective and I'm not really interested in whether or not what I'm doing fits into the current definition of effective computability.