Add to ORKGInternational audienceThis paper analyses issues of computer-assisted proofs focusing on one particular case, viz. that of proofs of particular instances of the Busy Beaver proble
The automation of first order logic has received comparatively little attention from researcher inte...
As the 21st century begins, the power of our magical new tool and partner, the computer, is increasi...
With the advent of powerful, widely-available mathematical software, combined with ever-faster compu...
International audienceThis paper analyses issues of computer-assisted proofs focusing on one particu...
In 1981 the editor of this bibliography was attracted to the Busy Beaver Problem by a reference in t...
70 pagesTibor Rado defined the Busy Beaver Competition in 1962. He used Turing machines to give expl...
As computers become a more prevalent commodity in mathematical research and mathematical proof, the ...
Some knowledge of what it means to construct a proof is an extremely important part of mathematics. ...
Mathematicians rarely present proofs in all their detail; usually they give just an outline or abstr...
For centuries, the highest level of mathematics has been seen as an isolated creative activity, to p...
According to some well-known mathematicians well-versed in computer-assisted mathematics (CaM), “Com...
The article is an attempt at collecting and systematising views on the role and place of computers i...
The aim of computer proof checking is not to find proofs, but to verify them. This is different fro...
The work's purpose was to develop and implement optimalization methods that could be used for solvin...
International audienceThis invited talk reflects on how the use of proof assistants is changing the ...
The automation of first order logic has received comparatively little attention from researcher inte...
As the 21st century begins, the power of our magical new tool and partner, the computer, is increasi...
With the advent of powerful, widely-available mathematical software, combined with ever-faster compu...
International audienceThis paper analyses issues of computer-assisted proofs focusing on one particu...
In 1981 the editor of this bibliography was attracted to the Busy Beaver Problem by a reference in t...
70 pagesTibor Rado defined the Busy Beaver Competition in 1962. He used Turing machines to give expl...
As computers become a more prevalent commodity in mathematical research and mathematical proof, the ...
Some knowledge of what it means to construct a proof is an extremely important part of mathematics. ...
Mathematicians rarely present proofs in all their detail; usually they give just an outline or abstr...
For centuries, the highest level of mathematics has been seen as an isolated creative activity, to p...
According to some well-known mathematicians well-versed in computer-assisted mathematics (CaM), “Com...
The article is an attempt at collecting and systematising views on the role and place of computers i...
The aim of computer proof checking is not to find proofs, but to verify them. This is different fro...
The work's purpose was to develop and implement optimalization methods that could be used for solvin...
International audienceThis invited talk reflects on how the use of proof assistants is changing the ...
The automation of first order logic has received comparatively little attention from researcher inte...
As the 21st century begins, the power of our magical new tool and partner, the computer, is increasi...
With the advent of powerful, widely-available mathematical software, combined with ever-faster compu...