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
Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions /
.
Bookmark this Record
Catalogue Record 46207
.
.
Author info on Wikipedia
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 46207
.
Reviews
Catalogue Record 46207
.
British Library
Resolver for RSN-46207
Google Scholar
Resolver for RSN-46207
WorldCat
Resolver for RSN-46207
Catalogo Nazionale SBN
Resolver for RSN-46207
GoogleBooks
Resolver for RSN-46207
ICTP Library
Resolver for RSN-46207
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
515.7
Title
Enumerability · Decidability Computability ([EBook] :) : An Introduction to the Theory of Recursive Functions / / by Hans Hermes.
Author
Hermes, Hans
Other name(s)
SpringerLink (Online service)
Publication
Berlin, Heidelberg : : Springer Berlin Heidelberg : : Imprint: Springer, , 1965.
Physical Details
X, 245 p. : online resource.
Series
Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berücksichtigung der Anwendungsgebiete
0072-7830 ; ; 127
ISBN
9783662116869
Summary Note
The task of developing algorithms to solve problems has always been considered by mathematicians to be an especially interesting and im portant one. Normally an algorithm is applicable only to a narrowly limited group of problems. Such is for instance the Euclidean algorithm, which determines the greatest common divisor of two numbers, or the well-known procedure which is used to obtain the square root of a natural number in decimal notation. The more important these special algorithms are, all the more desirable it seems to have algorithms of a greater range of applicability at one's disposal. Throughout the centuries, attempts to provide algorithms applicable as widely as possible were rather unsuc cessful. It was only in the second half of the last century that the first appreciable advance took place. Namely, an important group of the inferences of the logic of predicates was given in the form of a calculus. (Here the Boolean algebra played an essential pioneer role. ) One could now perhaps have conjectured that all mathematical problems are solvable by algorithms. However, well-known, yet unsolved problems (problems like the word problem of group theory or Hilbert's tenth problem, which considers the question of solvability of Diophantine equations) were warnings to be careful. Nevertheless, the impulse had been given to search for the essence of algorithms. Leibniz already had inquired into this problem, but without success.:
Contents note
1. Introductory Reflections on Algorithms -- 2. Turing Machines -- 3. ?-Recursive Functions -- 4. The Equivalence of Turing-Computability and?-Recursiveness -- 5. Recursive Functions -- 6. Undecidable Predicates -- 7. Miscellaneous -- Author and Subject Index.
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-3-662-11686-9
Links to Related Works
Subject References:
Functional Analysis
.
Mathematics
.
Mathematics, general
.
Authors:
Hermes, Hans
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Die Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Berücksichtigung der Anwendungsgebiete
.
Classification:
515.7
.
.
ISBD Display
Catalogue Record 46207
.
Tag Display
Catalogue Record 46207
.
Related Works
Catalogue Record 46207
.
Marc XML
Catalogue Record 46207
.
Add Title to Basket
Catalogue Record 46207
.
Catalogue Information 46207
Beginning of record
.
Catalogue Information 46207
Top of page
.
Download Title
Catalogue Record 46207
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
46207
1
46207
-
2
46207
-
3
46207
-
4
46207
-
5
46207
-
Quick Search
Search for