We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
Consider a closed curve in the plane that does not intersect itself; by the Jordan-Schoenflies Theorem, it bounds a distorted disk. Now consider a closed curve that intersects its...
Abstract. The increased availability and robustness of sensors, the wide-spread use of the internet as a communication environment and the intensified adoption of semantic technolo...
This paper presents a game semantics for a simply-typed λ-calculus with qbits constants and associated quantum operations. The resulting language is expressive enough to encode a...