Enumerability, Decidability, Computability : An Introduction to the Theory of Recursive Functions.

By:

Hermes, Hans

Contributor(s):

Material type: Text

TextSeries: Grundlehren der Mathematischen Wissenschaften SeriesPublisher: Berlin, Heidelberg : Springer Berlin / Heidelberg, 1969Copyright date: ©1965Edition: 1st edDescription: 1 online resource (255 pages)Content type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783662116869

Subject(s):

Mathematics

Genre/Form:

Electronic books.

Additional physical formats: Print version:: Enumerability, Decidability, ComputabilityDDC classification:

LOC classification:

QA319-329.9

Online resources:

Click to View

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

There are no comments on this title.

to post a comment.