Algorithmic
Take for example the definition of a natural number. It is easy (although it might be tedious) to prove if a number is a natural number by using this algorithm (which is something I just came up with, but which I'm sure anyone can do likewise):
- Accept a given real number, x.
- Is the number zero? If so, the number is/was a natural number and you terminate.
- Subtract 1. Is the number less than zero? If so, the number was not a natural number and you terminate.
- Repeat step 3.
You can do this with all kinds of things for the sake of fun, profit, indulgence, curiosity or perversity. It helps you do things like mentally convert any kind of distribution to one that can be compared to a normal distribution, for example. It can even help you write the minutes of meetings before the meeting is carried out. Seriously. Used to do that all the time, they were that predictable...
Labels: Algorithms, Computing, Logic, Numbers
0 Comments:
Post a Comment
<< Home