On Tuesday, November 5, 2013 2:24:21 PM UTC-8, Ben Bacarisse wrote: > email@example.com writes: > > That's too general, in my opinion. You need a funny representation that > > makes the question rather debatable -- one could argue that the > > representation has done most of the work of the addition. >
OK, if FSMs could do Logs then maybe you'd have a reasonable objection.
Formally it's just a derivation, the impossible proof by contradiction is after the representation is decided, AFAIK.
But it's a strong result, formally you cannot even say ADDITION and MULTIPLICATION... substitute the term ADDITION for "ADDITION AS WE KNOW IT" and the proof holds bona fide!