Date: Thu, 18 Oct 2001 12:26:01 +0100 From: Ben Laurie <ben@algroup.co.uk> Hehe - if we're going to pick nits, isn't Church's Thesis unproven? :-) It's probably unprovable :-(. But I was referring to his discovery that lambda-calculus was computationally universal (which has a formally provable meaning in terms of Turing machines), not to the "thesis".