Re:Some Functional Programmers Are Arrogant
by sklogic on Wednesday July 08, 2015 @02:21PM
(#9853648)
Yet, Turing machine is much easier and is almost always a first choice for a complexity research. Of course, it heavily depends on a nature of an algorithm.
[ Parent
| on HN ]
I'm not confident that it's much easier in any universal sense, but I certainly agree that the nature of at least the presentation of an algorithm defines the easiest way to talk about its analysis.