3690 search results - page 40 / 738 » Computation with classical sequents |
FSS
2008
13 years 10 months ago
2008
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they commu...
KR
2010
Springer
13 years 8 months ago
2010
Springer
Measuring the inconsistency degree of a knowledge base can help us to deal with inconsistencies. Several inconsistency measures have been given under different multi-valued semant...
ENTCS
2008
13 years 10 months ago
2008
In this paper we study the relation between reversible and irreversible computation applicable to different models of computation -- here we are considering classical and quantum ...
CIE
2009
Springer
14 years 5 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...