1101 search results - page 76 / 221 » Forcing in proof theory |
118
Voted
JAIR
2008
15 years 17 days ago
2008
In this paper, we elucidate the equivalence between inference in game theory and machine learning. Our aim in so doing is to establish an equivalent vocabulary between the two dom...
128
click to vote
AISC
1998
Springer
15 years 4 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
96
Voted
CADE
2007
Springer
16 years 26 days ago
2007
Springer
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
111
Voted
STOC
1993
ACM
15 years 4 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
APAL
2010
15 years 21 days ago
2010
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...