P == NP proof

Sudoku solving is NP complete^[1]
Human brains can solve sudoku in polynomial time
There exists one example of polynomial time solving of a NP complete problem => P == NP.

^[1]http://www.cs.ox.ac.uk/people/paul.goldberg/FCS/sudoku.html

>>28
Recursion isn't actually that important. Any tail-recursive algorithm can trivially be converted to a non-recursive algorithm.