Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Computability: A Mathematical Sketchbook
.
Bookmark this Record
Catalogue Record 47091
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 47091
.
Reviews
Catalogue Record 47091
.
British Library
Resolver for RSN-47091
Google Scholar
Resolver for RSN-47091
WorldCat
Resolver for RSN-47091
Catalogo Nazionale SBN
Resolver for RSN-47091
GoogleBooks
Resolver for RSN-47091
ICTP Library
Resolver for RSN-47091
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
510
Title
Computability ([EBook]) : A Mathematical Sketchbook / by Douglas S. Bridges.
Author
Bridges, Douglas S. , 1945-
Other name(s)
SpringerLink (Online service)
Publication
New York, NY : Springer , 1994.
Physical Details
XI, 180 pages : online resource.
Series
Graduate texts in mathematics
0072-5285 ; ; 146
ISBN
9781461208631
Summary Note
Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.:
Contents note
Preliminaries -- 1 What Is a Turing Machine? -- 2 Computable Partial Functions -- 3 Effective Enumerations -- 4 Computable Numbers and Functions -- 5 Rice’s Theorem and the Recursion Theorem -- 6 Abstract Complexity Theory -- Solutions to Exercises -- Solutions for Chapter 1 -- Solutions for Chapter 2 -- Solutions for Chapter 3 -- Solutions for Chapter 4 -- Solutions for Chapter 5 -- Solutions for Chapter 6 -- References.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-1-4612-0863-1
Links to Related Works
Subject References:
Mathematics
.
Mathematics, general
.
Authors:
Bridges, Douglas S. 1945-
.
Bridges, Douglas S., 1945-
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Graduate texts in mathematics
.
GTM
.
Classification:
510
.
.
ISBD Display
Catalogue Record 47091
.
Tag Display
Catalogue Record 47091
.
Related Works
Catalogue Record 47091
.
Marc XML
Catalogue Record 47091
.
Add Title to Basket
Catalogue Record 47091
.
Catalogue Information 47091
Beginning of record
.
Catalogue Information 47091
Top of page
.
Download Title
Catalogue Record 47091
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
47091
1
47091
-
2
47091
-
3
47091
-
4
47091
-
5
47091
-
Quick Search
Search for