Enumerability
Published in Cambridge University Press eBooks • Sep 17, 2007
NobleIDNI7P21W92R16S13
Authors:
John P. Burgess
Abstract
Our ultimate goal will be to present some celebrated theorems about inherent limits on what can be computed and on what can be proved. Before such results can be established, we need to undertake an analysis of computability and an analysis of provability. Computations involve positive integers 1, 2...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!