News for hackers. Stuff that matters.

A comment on When are two proofs essentially the same? (2007). Parent comment

Re:When are two proofs essentially the same? (2007) by naniwaduni on Wednesday October 30, 2024 @03:47PM (#41999395)
> If we don't treat almost all integers in an algorithm as fixed size then the analysis gets really messy and annoying in a way that has nothing to do with real computers.

I guess nobody does numerical computing or distributed systems with real computers anymore, huh.

[ Parent | on HN ]
Re:When are two proofs essentially the same? (2007) by Dylan16807 on Wednesday October 30, 2024 @05:59PM (#42000904)
Wrong way around. Almost all the numbers in those systems are fixed-size. There's a few types of variable width payload, but all the little ancillary types are 64 bits or whatever.
[ Parent | on HN ]