[continued from previous message]   
      
   >>>>> to require sum(3,2) to return the sum of 5+6.   
   >>>>   
   >>>> What   
   >>>>    int sum(int x, int y){return x + y;}   
   >>>> should return either is specified somewhere or is not specified.   
   >>>> In the former case it should do as the document says, in the   
   >>>> latter case no return value is wrong.   
   >>>>   
   >>>> However, C rules specify what that function must return. If the   
   >>>> function   
   >>>> returns something other than 5 it violates C rules regardless what it   
   >>>> is required to return.   
   >>>   
   >>> Likewise a halt decider is required to report on the   
   >>> behavior that its input finite string actually   
   >>> specifies.   
   >>   
   >> That does not mean anuthing without interpretation rules. Without them   
   >> strings are merely uninterpreted strings that don't specify anything.   
   >> Also needed is a proof that every conputation is an interpretaion of   
   >> some string according to the inpterpretation rules.   
   >   
   > (a) TMs only transform input finite strings to values   
   > using finite string transformation rules.   
   >   
   > (b) There exists no alternative more definitive measure   
   > of the behavior that the input to H(P) specifies (within   
   > finite string transformation rules) than P simulated by H.   
      
   The halting problem does not ask about a string. It asks about   
   a meaning, which is a computation. Therefore the measure of the   
   behaviour is the computation asked about. If the input string   
   does not specify that behaviour then it is a wrong string.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)