[FOM] Proofs in Computability Theories

Steve Stevenson steve at cs.clemson.edu
Tue Sep 15 19:27:17 EDT 2009

In class the other day, a question arose about intuitionism and  
computability. I would appreciate views on these two aspects:
1. Shouldn't the study of computability be constructive - thinking of  
Markov, and
2. Shouldn't the proofs therefore be intuitionistic?

It seems to me that in text books, number 1 is true and number 2 is  
Steve Stevenson

The surest way to become a pacifist is to join the infantry. --- Bill  

More information about the FOM mailing list