Can I read Computability : an Introduction to Recursive Function Theory on EtoBox?

Computability : an Introduction to Recursive Function Theory by Nigel J Cutland is a nonfiction available to read on EtoBox.

What is Computability : an Introduction to Recursive Function Theory about?

What Can Computers Do In Principle? What Are Their Inherent Theoretical Limitations? These Are Questions To Which Computer Scientists Must Address Themselves. The Theoretical Framework Which Enables Such Questions To Be Answered Has Been Developed Over The Last Fifty Years From The Idea Of A Computable Function: Intuitively A Function Whose Values Can Be Calculated In An Effective Or Automatic Way. This Book Is An Introduction To Computability Theory (or Recursion Theory As It Is Traditionally Known To Mathematicians). Dr Cutland Begins With A Mathematical Characterisation Of Computable Functions Using A Simple Idealised Computer (a Register Machine); After Some Comparison With Other Characterisations, He Develops The Mathematical Theory, Including A Full Discussion Of Non-computability And Undecidability, And The Theory Of Recursive And Recursively Enumerable Sets. The Later Chapters Provide An Introduction To More Advanced Topics Such As Gildel's Incompleteness Theorem, Degrees Of Unsolvability, The Recursion Theorems And The Theory Of Complexity Of Computation. Computability Is Thus A Branch Of Mathematics Which Is Of Relevance Also To Computer Scientists And Philosophers. Mathe

Who reads Computability : an Introduction to Recursive Function Theory?

Author

Nigel J Cutland

Publisher

Cambridge University Press (Virtual Publishing)

Published

1980

Language

EN

ISBN

9781139927031

Category

nonfiction

Subjects

Mathematics, Computer Science, Programming