Guys,
I don't know thw quality of Noson's definition.
But it is not "off the mark" as you feel. His way of defining algorithm is quite common. There is no circular-reference as you feel. Since algorithm is an abstract concept, you cannot form theories on it. You need something concrete. For that purpose he defines algorithm as the "Set of programs which implement it". By using such a definition, now you have a concrete thing in hand to define algorithms.
If you still oppose him, then you need to read some Theory of computability where you can see such definitions often. His definition breaks down an algorithm into very small pieces which can be easily manipulated. This is what Computability theory is all about.
Read about, Primitive recursive functions to understand this type of definitions...

Regards,
Prunthaban


--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to