James M. Calvin A lower bound on complexity of optimization on the Wiener space. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:383, n:2-3, pp:132-139 [Journal]
Eugene Eberbach The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:383, n:2-3, pp:200-243 [Journal]
Mark Burgin Algorithmic complexity as a criterion of unsolvability. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:383, n:2-3, pp:244-259 [Journal]