Production rule schemes have proven quite effective in concisely representing expert knowledge in several application areas. Yet, there are many problems for which one would like to take advantage of additional knowledge that may not be easily represented in these surface level models. One class of problems of particular practical interest are those in which we would like to have a computer-bas...

Foreign direct investment by western-based MNCs in developing countries is argued to be both a potential source of conflict and an instrument to promote development and peace. Yet there has been very little analysis of the micro-level factors that determine whether an MNC is likely to have a positive or negative impact on a conflict situation. A single case study provides the opportunity to inv...

In the s Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object s structure In particular Bennett identi ed the classes of weakly deep and strongly deep sequences and showed that the halting problem is strongly deep Juedes Lath rop and Lutz subsequently extended this result by de ning the class of weakly useful sequences an...

This paper investigates the structure of ESPACE under nonuniformTuring reductions that are computed by polynomial size circuits P Poly Turing reductions A Small Span Theorem is proven for such reductions This result says that every language A in ESPACE satis es at least one of the following two conditions i The lower P Poly Turing span of A consisting of all languages that are P Poly Turing red...

The resource-bounded measures of complexity classes are shown to be robust with respect to certain changes in the underlying probability measure. Speci cally, for any real number > 0, any uniformly polynomial-time computable sequence ~ = ( 0; 1; 2; : : : ) of real numbers (biases) i 2 [ ; 1 ], and any complexity class C (such as P, NP, BPP, P/Poly, PH, PSPACE, etc.) that is closed under positiv...