How to Compare the Incomparable
نویسنده
چکیده
A technique for deciding between two processes, one with cost (xA ,yA) and the second with cost (xB ,yB) where xA>xB and yA<yB and no further information is available, is derived, using dimensionand gauge-theory like arguments. The technique can be summarized as: If you can’t add them, multiply them.
منابع مشابه
Comparing Incomparable Frameworks: A Model Theoretic Approach to Phonology
In previous work, we used techniques from mathematical logic and model theory to study and compare two phonological theories, SPE and Government Phonology. The surprising result was that Government Phonology corresponds to a very weak fragment of SPE, yet it can attain the full expressivity of the latter through more powerful mechanisms of feature spreading. An issue that we didn’t elaborate on...
متن کاملGeneral classes of impossible operations through the existence of incomparable states
In this work we show that the most general class of anti-unitary operators are nonphysical in nature through the existence of incomparable pure bipartite entangled states. It is also shown that a large class of inner-product-preserving operations defined only on the three qubits having spin-directions along x, y and z are impossible. If we perform such an operation locally on a particular pure ...
متن کاملCompliance and Testing Preorders Differ
Contracts play an essential role in the Service Oriented Computing, for which they need to be equiped with a sub-contract relation. We compare two possible formulations, one based on compliance and the other on the testing theory of De Nicola and Hennessy. We show that if the language of contracts is sufficiently expressive then the resulting subcontract relations are incomparable. However if w...
متن کاملComparison of the expressiveness w.r.t. timed bisimilarity of k-bounded Arc, Place and Transition Time Petri Nets with weak and strong single server semantics
In this paper, we consider bounded Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper...
متن کاملElection and rendezvous with incomparable labels
In “Can we elect if we cannot compare” (SPAA’03), Barrière, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each distributed mobile environment,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 24 شماره
صفحات -
تاریخ انتشار 1987