Metaculus
M
Questions
Tournaments
Leaderboards
News
More
create
Log in
a
/
文
notebook
Computability and Complexity
by
ege_erdil
•
Feb 6, 2022
•
Edited on Mar 6, 2024
•
14 min read
1 comment
Metaculus Journal
Categories:
Computing and Math
Tags:
Number theory
Fermat's Last Theorem
Diagonal argument
First-order logic
NP-completeness
Andrew Wiles
Richard Borcherds
Ryan Williams (computer scientist)
Millennium Prize Problems
Philosophy
Gödel's incompleteness theorems
Turing machine
Halting problem
Logic
Busy beaver
Peano axioms
Zermelo–Fraenkel set theory
P versus NP problem
Comments
recent
? comments
Log in
Load more comments
