In a catalogue for computer-based models the basic problem is that complex interdependencies between models must be addressed, which are dependent on an application's domain....
We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show t...
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Web service technologies are becoming increasingly important for integrating systems and services. There is much activity and interest around standardization and usage of web serv...