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(2n) on my shining new rewriting engine, then it's time to doubt the usefulness of my engine in practice. By Andris Birkmanis at 2005-07-21 07:00 | LtU Forum | previous forum topic | next forum topic | other blogs | 11266 reads
|
Browse archives
Active forum topics
|
Recent comments
14 weeks 2 days ago
18 weeks 4 days ago
20 weeks 1 day ago
20 weeks 1 day ago
22 weeks 6 days ago
27 weeks 3 days ago
27 weeks 3 days ago
27 weeks 6 days ago
27 weeks 6 days ago
30 weeks 5 days ago