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 | 11363 reads
|
Browse archives
Active forum topics |
Recent comments
6 weeks 14 hours ago
6 weeks 18 hours ago
6 weeks 18 hours ago
28 weeks 1 day ago
32 weeks 3 days ago
34 weeks 1 day ago
34 weeks 1 day ago
36 weeks 5 days ago
41 weeks 3 days ago
41 weeks 3 days ago