Home Book reviews Contact

Every adversity, every failure, every heartache carries with it the seed of an equal or greater benefit.

Napoleon Hill

One more random pick among 2000+ quotes

touch the result table below to hide quote

Search for "Keyword: 9780521223843 ,ISBN: 9780521223843, " ..
this may take at most 15 seconds ..
 
Please share to
Our search for Keyword: 9780521223843 ,ISBN: 9780521223843, brought up 1 title(s), showing 1 - 1. 3 removed. Sorting by Price Ascending.
Save this search Show quote
Search for "ISBN: 9780521223843" at eBay
Please follow us on AddALL Facebook page twitter page
TITLE

SORT

change title size: 16
AUTHOR

SORT

change author size: 16
PRICE

16
Bookstore

SORT

16
DESCRIPTION

 

change description size: 16
Cutland Nigel
author size: 16
USD
77.00
price size: 16
Quadrant Book Mart /Biblio
dealer size: 16
Cambridge: Cambridge University Press, Date: 1980. Ex-Library. Hardcover. Good/None. Black cloth boards with silver titling on spine. No exterior indication of ex-library; Inside, title page is embossed with Cornell University blindstamp, the front pastedown is scarred where bookplate was removed, and the rear fep bears black stamp of the mathematics library at Cornell with date. The text is unmarked. Binding is sound. Overall, a decent, readable book. 8vo. BOOK INFO: '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, t ...
description size: 16

DISCLOSURE: When you use one of our links to make a purchase, we may earn a commission at no extra cost to you.
As an Amazon Associate, AddALL earn commission from qualifying Amazon purchases.


TOO Many Search Results? Refine it!
Exclude: (what you don't want)
Include: (what you want)
Search Results Sort By:
220807180535937502