search for books and compare prices
Nigel Cutland has written 4 work(s)
Search for other authors with the same name
displaying 1 to 4 | at end
show results in order: alphabetically | oldest to newest | newest to oldest
Cover for 9783540413844 Cover for 9780521359474 Cover for 9780521351096 Cover for 9780521223843 Cover for 9780521294652
cover image for 9780521359474
Product Description: This textbook is an introduction to non-standard analysis and to its many applications. Non standard analysis (NSA) is a subject of great research interest both in its own right and as a tool for answering questions in subjects such as functional analysis, probability, mathematical physics and topology...read more

Paperback:

9780521359474 | Cambridge Univ Pr, March 1, 1989, cover price $79.99 | About this edition: This textbook is an introduction to non-standard analysis and to its many applications.

cover image for 9780521351096
Product Description: This textbook is an introduction to non-standard analysis and to its many applications. Non standard analysis (NSA) is a subject of great research interest both in its own right and as a tool for answering questions in subjects such as functional analysis, probability, mathematical physics and topology...read more

Hardcover:

9780521351096 | 1 edition (Cambridge Univ Pr, September 30, 1988), cover price $54.50 | About this edition: This textbook is an introduction to non-standard analysis and to its many applications.

cover image for 9780521294652
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. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest. (view table of contents)

Hardcover:

9780521223843 | Cambridge Univ Pr, August 1, 1980, cover price $75.00 | About this edition: What can computers do in principle?

Paperback:

9780521294652 | Cambridge Univ Pr, November 1, 1980, cover price $64.99

displaying 1 to 4 | at end