|Just another Perl shrine|
Re: OT: Mathematics for programming (again)by BrowserUk (Pope)
|on Sep 10, 2008 at 23:00 UTC||Need Help??|
Given a sorted array and a value we know is in it, why can we know for sure that if we search it in linear order starting at the beginning, we will eventually always find the value at some index?
Because we know it will. How would having a proof of that help a programmer?
but the mythical algebra could be built on simple theorems like this, much like Eucledian geometry, and then expanded to cover deeper and more meaningful theorems.
When someone shows me how math can help me write code to deal with
Math theorems tend to only work under very specific sets of assumables, which real-world code rarely enjoys.
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.