Network profile

Chris Jerdonek

Reputation

485

Top tag

lo.logic

500 Rep.

Access review queues

Yearling

0/1

0 posts edited

0 helpful flags

5 votes cast

34	Are there examples of statements that have been proven whose consistency proofs came before their proofs?
4	How much of P versus NP's difficulty stems from having to rule out the existence of Turing machines that “accidentally” solve, say, 3-SAT efficiently?

This user has no recent positive reputation changes

This user has not answered any questions

0 lo.logic × 2	0 computational-complexity
0 set-theory

This user has no bookmarked questions.

Stack Overflow	4,434 rep	2 gold badges27 silver badges24 bronze badges
MathOverflow	485 rep	3 silver badges7 bronze badges
English Language & Usage	101 rep
Super User	101 rep	1 bronze badge