Sciweavers

33 search results - page 2 / 7
» Coincidences Are not Accidental: a Theorem
Sort
View
ENTCS
2008
97views more  ENTCS 2008»
13 years 7 months ago
POVMs and Naimark's Theorem Without Sums
duce an abstract notion of POVM within the categorical quantum mechanical semantics in terms act categories. Our definition is justified by two facts: i. we provide a purely graph...
Bob Coecke, Éric Oliver Paquette
DCG
2000
67views more  DCG 2000»
13 years 7 months ago
A Theorem on Higher Bruhat Orders
We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n; 2), i.e., B(n; 2) = B (n; 2). Mathematics Subject Classi cations (1991). 06A06, 51G05,...
Stefan Felsner, Helmut Weil
JOLLI
2002
74views more  JOLLI 2002»
13 years 7 months ago
Referent Systems and Relational Grammar
Abstract. Relational Grammar (RG) was introduced in the 70's as a theory of grammatical relations and relation change, for example, passivization, dative shift, and raising. F...
Marcus Kracht
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 7 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 7 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson