[Sussex] Challenge

[Geoff Teale]

Mark,

You wrote some very nice proof.. I've snipped it all, because essentially
you've done something very similar to Steve (though perhaps more
rigourously) - you've side-stepped the need to represent 0.1 itself by using
alternative representation. 

This is all good, and you are both right, these are accurate, logical binary
representation 
of the number, and thus very good arguements.  None the less, any attempt to
process either the proof put forward by you, or by Steve on a binary
computer will result in inequalities or the use of fudge factors.  I would
suggest the only way around this is to map you structures to matching
structures in memory rather than resolve the equations.



-- 
GJT
Free Software, Free Society. 
http://www.fsf.org   http://www.gnu.org


The above information is confidential to the addressee and may be privileged.  Unauthorised access and use is prohibited.
 
Internet communications are not secure and therefore this Company does not accept legal responsibility for the contents of this message.
 
If you are not the intended recipient, any disclosure, copying, distribution or any action taken or omitted to be taken in reliance on it, is prohibited and may be unlawful.
 
Claybrook Computing Limited is a subsidiary of Claybrook Computing (Holdings) Limited
Registered Office: Abbey House. 282 Farnborough Road, Farnborough, Hampshire GU14 7NJ
Registered in England and Wales No 1287205
 
A Hogg Robinson plc company