Turing Computability
Published in Cambridge University Press eBooks • Sep 17, 2007
NobleIDNI8P98W29R70S65
Authors:
John P. Burgess
Abstract
A function is effectively computable if there are definite, explicit rules by following which one could in principle compute its value for any given arguments. This notion will be further explained below, but even after further explanation it remains an intuitive notion. In this chapter we pursue th...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!