Sciweavers

351 search results - page 27 / 71
» Classical Logic with Partial Functions
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 2 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
MMSEC
2006
ACM
167views Multimedia» more  MMSEC 2006»
14 years 1 months ago
Hermite polynomials as provably good functions to watermark white gaussian hosts
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
Teddy Furon
ISMVL
2008
IEEE
148views Hardware» more  ISMVL 2008»
14 years 1 months ago
Quantum Logic Implementation of Unary Arithmetic Operations
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...
Mitchell A. Thornton, David W. Matula, Laura Spenn...
TPHOL
1997
IEEE
13 years 11 months ago
Higher Order Quotients and their Implementation in Isabelle HOL
This paper describes the concept of higher order quotients and an implementation in Isabelle. Higher order quotients are a generalization of quotients. They use partial equivalence...
Oscar Slotosch
FSTTCS
2006
Springer
13 years 11 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...