Tag Info

New answers tagged

0

You want to know if there is an easy way to identify if an algorithm is O(log N). Well: just run and time it. Run it for inputs 1.000, 10.000, 100.000 and a million. If you see like a running time of 3,4,5,6 seconds (or some multiple) you can safely say it's O(log N). If it's more like : 1,10,100,1000 seconds then it's probably O(N). And if it's like ...


3

Short answer in two words: OBSERVABLE NONDETERMINISM Long answer: It depends on which approach to concurrent programming you use given your problem. In the book Concepts, Techniques, and Models of Computer Programming, authors clearly explain four main practical approaches to writing concurrent programs: Sequential programming: a baseline approach that ...


2

It is certainly possible to define an iteration order for x1 <- [1..], x2 <- [1..], ..., xK <- [1..] that will reach any tuple (c1, c2, ..., cK) after some finite amount of steps, and tries each tuple only once. Take any computable bijection between the natural numbers N and the k-tuples of natural numbers, N^k. Such a bijection exists, as the ...



Top 50 recent answers are included