User loginNavigation 
The Complexity Zoo
Way too often PL designers refer to Turing machine or other formalism as a benchmark of expressivity. For practical needs, though, the algorithmical complexity of programs is quite important. E.g., if the program takes O(n) steps on Turing machine, but O(2^{n}) on my shining new rewriting engine, then it's time to doubt the usefulness of my engine in practice. By Andris Birkmanis at 20050721 07:00  LtU Forum  previous forum topic  next forum topic  other blogs  7804 reads

Browse archivesActive forum topics 
Recent comments
7 hours 23 min ago
8 hours 47 min ago
10 hours 14 min ago
11 hours 25 min ago
12 hours 5 min ago
14 hours 54 min ago
15 hours 57 min ago
18 hours 18 min ago
23 hours 49 min ago
1 day 1 hour ago