Promise problems have been introduced in 1985 by S.Even e.a. as a generalization of decision problems. Using a very general approach we study solvability and unsolvability conditions for promise problems of set families and languages. We show, that cores of unsolvability are completely determined by partitions of cohesive sets. We prove the existence of cores in unsolvable promise problems assu...

When the original Task Force was created in 1999 and throughout following years as group evolved, question always “What about cat? will you do same for cat?” No matter when or to whom asked this question, answer always: “Don’t worry, we get cat”. The promise kept – they finally “got International Committee on Allergic Diseases of Animals (ICADA) Cat Team (ICT) has provided veterinary dermatolog...

We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into P implies linear-exponential circuit lower bounds for E. Our proof is simpler and yields stronger results. In particular, consider the promise-AM problem of distinguishing between the case where a given Boolean circuit C accepts at least a given number b of inputs, and the cas...

Ontological modelling for machine inference has featured prominently in IT management research recently, but there is more immediate scope for knowledge modelling in the realm of human inference. This work discusses the relationship between ISO Standard Topic Maps and Promise Theory and shows how these two knowledge models models complement one another and offer a semantic approach to policy ba...

Some of the most interesting and important results concerning quantum finite automata are those showing that they can recognize certain languages with (much) less resources than corresponding classical finite automata. This paper shows three results of such a type that are stronger in some sense than other ones because (a) they deal with models of quantum finite automata with very little quantu...

Networking is undergoing a transformation throughout our industry. The need for scalable network control and automation shifts the focus from hardware driven products with ad hoc control to Software Defined Networks. This process is now well underway. In this paper, we adopt the perspective of the Promise Theory to examine the current and future states of networking technologies. The goal is to...

Query complexity, or why is it dicult to separate NP A T coNP A from P A by random oracles A. 24 as a result of an exhaustive search, thus x 6 2 L; hence M is a robust machine accepting L. Now suppose x 2 L and the promise problem A dened above is used as the oracle. We show that x is accepted in polynomial time.

The framework of promise theory offers an alternative way of understanding programming models, especially in distributed systems. We show that promise theory can express some familiar constructs and resolve some problems in program interface design, using fewer and simpler concepts than the Unified Modelling Language (UML).

Using Promise Theory as a calculus, I review how to define agency in a scalable way, for the purpose of understanding semantic spacetimes. By following simple scaling rules, replacing individual agents with ‘super-agents’ (sub-spaces), it is shown how agency can be scaled both dynamically and semantically. The notion of occupancy and tenancy, or how space is used and filled in different ways, i...