Date: Jan 12, 2013 4:48 PM
Author: Graham Cooper
Subject: The MYTH of UNCOMPUTABLE FUNCTIONS

Turing's Halt Proof clearly proves that

HALT( program, input ) --> [yes/no]

is not a PURE FUNCTION!

*****************************

Since HALT(p,i) is designed for PROGRAM TESTING
this is not even a concern!

If HALT(p,i) detected a halt function within the program
it was testing it could accurately output the result
- "sub halt procedure detected - results not guaranteed"


S: if stops(S) gosub S
G. GREENE: this proves stops() must be un-computable!





G. Cooper (BInfTech)
--
http://tinyURL.com/BLUEPRINTS-MATHEMATICS
http://tinyURL.com/BLUEPRINTS-HYPERREALS
http://tinyURL.com/BLUEPRINTS-QUESTIONS
http://tinyURL.com/BLUEPRINTS-POWERSET
http://tinyURL.com/BLUEPRINTS-THEOREM
http://tinyURL.com/BLUEPRINTS-PROLOG
http://tinyURL.com/BLUEPRINTS-FORALL
http://tinyURL.com/BLUEPRINTS-TURING
http://tinyURL.com/BLUEPRINTS-GODEL
http://tinyURL.com/BLUEPRINTS-PROOF
http://tinyURL.com/BLUEPRINTS-MATHS
http://tinyURL.com/BLUEPRINTS-LOGIC
http://tinyURL.com/BLUEPRINTS-BRAIN
http://tinyURL.com/BLUEPRINTS-PERM
http://tinyURL.com/BLUEPRINTS-REAL
http://tinyURL.com/BLUEPRINTS-SETS
http://tinyURL.com/BLUEPRINTS-HALT
http://tinyURL.com/BLUEPRINTS-P-NP
http://tinyURL.com/BLUEPRINTS-GUT
http://tinyURL.com/BLUEPRINTS-BB
http://tinyURL.com/BLUEPRINTS-AI