Re:Nearly All Binary Searches and Mergesorts Are Broken (2006)
by tgb on Saturday July 23, 2016 @07:19AM
(#12149152)
It's not impossible to guarantee that a system has sufficient memory for all possible inputs. Look at high stakes embedded software development. You need more control than you get as an application on a desktop computer but there's nothing inherent about finite state machines that make them vulnerable.
[ Parent
| on HN ]
There are no comments on this comment yet.