Orchid XP v7 <voi### [at] devnull> wrote:
> Are you saying there are things that can be calculated but not by a 
> Turing machine?

  As far as I can see, the Church-Turing thesis ("if an algorithm
(a procedure that terminates) exists then there is an equivalent Turing
Machine or applicable lambda-function for that algorithm") is a
hypothesis, not an axiom:

http://en.wikipedia.org/wiki/Church-Turing_thesis

  The concept of hypercomputability, while theoretical, has been
considered.

http://en.wikipedia.org/wiki/Hypercomputation

-- 
                                                          - Warp

Post a reply to this message