Back to Results
First PageMeta Content
Computer science / Theory of computation / Busy beaver / Turing machine / Halting problem / Computable function / Alan Turing / Mathematical proof / Computability / Mathematics / Theoretical computer science / Computability theory


Looking for Busy Beavers. A socio-philosophical study of a computer-assisted proof. Liesbeth De Mol∗ [removed]
Add to Reading List

Document Date: 2011-11-29 04:50:50


Open Document

File Size: 216,03 KB

Share Result on Facebook

City

Flanders / /

Company

BBC / /

Country

Belgium / /

/

Holiday

Christmas / /

IndustryTerm

steel bridges / last steel bridge / heuristic solution / certain computer applications / computing / steel bridge / automatic systems / http /

Organization

U.S. Securities and Exchange Commission / Fund for Scientific Research / /

Person

John von Neumann / Terry Ligocki / Derrick Henry Lehmer / Shawn Ligocki / Van Bendegem / Thomas Hales / /

Position

researcher / read-write head / mathematician / writer / /

URL

http /

SocialTag