Main Menu
Main Menu
Non Deterministic Algorithms
Non Deterministic Algorithms
One of the biggest areas today in computational science is the modelling of nature. There are times where by observing nature, the events that unfold each day could be considered random. A great deal of effort and research is undertaken in all of today's modern sciences to discover the unknown, what, how and why are common questions which engage scientists daily.

It is our understanding that nature has n laws and nothing in nature is exempt from these laws. The initial problem is merely identifying the laws and thereby accepting them, our progression in the world of physics illustrates this time and time again. In the world of computing, nature is one aspect that may need to be modelled (simulations, mathematical modelling, games, etc), applying the current known laws of nature is not something that need be difficult which an algorithm illustrated shortly will emphasize.

Take for instance the concept of a person tearing an extract from a newspaper. Whilst the event is triggered by a human, nature is fundamentally the element that tears the paper in relation to the angle and force applied by the human. We can logically conclude that from a physics perspective, the resultant tear of the paper is due to the angle, applied force and the microscopic densities that exist in the paper. These varying densities in the fabric cannot be observed with the naked eye but they exist and contribute to the resultant tear none the less.

In order for a piece of software to simulate this tear, there needs to be a mechanism that can produce viable results since both the human and nature are absent at least "practically". In computer science, this is where algorithms can be applied to fulfil the role of nature and the human. An algorithm is a sequence of statements that the computer computes to complete a task, other terminology would state an algorithm is a finite procedure of statements.