Menu
Home
Advanced Search
Directory of Libraries
About lib.ir
Contact Us
History
عنوان
Enumerability, decidability, computability. An introduction to the theory of recursive functions
پدید آورنده
Harmes, Hans
موضوع
، Recursive functions,، Algebraithms,، Godel's theorem
رده
QA
248
.
5
.
H413
1969
کتابخانه
Central Library and Information Center of Ferdowsi University of Mashhad
محل استقرار
استان:
Khorasan Razavi
ـ شهر:
Mashhad
تماس با کتابخانه :
05138806503
OTHER STANDARD IDENTIFIER
Standard Number
6907
Standard Number
2817
TITLE AND STATEMENT OF RESPONSIBILITY
First Statement of Responsibility
Harmes, Hans
Title Proper
Enumerability, decidability, computability. An introduction to the theory of recursive functions
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Berlin; New York
Name of Publisher, Distributor, etc.
Springer-Verlag
Date of Publication, Distribution, etc.
1969
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
x, 245p
SERIES
Series Title
Die Grundlegren der mathematischen Wissenschaften in Einzeldarstellungan mit besonderer Berucksichtigung der Anwendungsgebiete, Bd.721
GENERAL NOTES
Text of Note
Translation of Aufzahlbarkeit, Entscheidbarkeit, Berechembarkeit
Text of Note
Includes bibliographies
NOTES PERTAINING TO TITLE AND STATEMENT OF RESPONSIBILITY
Text of Note
translated by G.T.Hermann and O.Plassmann
NOTES PERTAINING TO EDITION AND BIBLIOGRAPHIC HISTORY
Text of Note
2nd rev.ed.
TOPICAL NAME USED AS SUBJECT
Entry Element
، Recursive functions
Entry Element
، Algebraithms
Entry Element
، Godel's theorem
LIBRARY OF CONGRESS CLASSIFICATION
Class number
QA
248
.
5
.
H413
1969
PERSONAL NAME - PRIMARY RESPONSIBILITY
Relator Code
AU
AU Hermann ,G.T. tr.
AU Plassmann, O. tr.
TI
SE
LOCATION AND CALL NUMBER
Call Number Suffix
CL
Call Number Suffix
CL
Proposal/Bug Report
×
Proposal/Bug Report
×
Warning!
Enter The Information Carefully
Error Report
Proposal