NobleBlocks
Public

Computability

Published in Princeton University Press eBooks • Sep 24, 2019
NobleIDNI2P56W19R29S97
Authors:
John Stillwell

Abstract

This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a ...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!