Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Prerequisites and Notation Read chapter Read first chapter

1987 | OriginalPaper | Chapter

Recursive and Recursively Enumerable Sets

Author : Prof. Dr. Klaus Weihrauch

Published in: Computability

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

In the previous chapters we have studied computable functions f: ℕk → N and f: (W(Σ))k→W(Σ). The concept of computability is now used to define recursiveness and recursive enumerability of subsets A ⊆ ℕk and B ⊆ (W(Σ))k.

previous chapter Comparison of Number and Word Functions, Church’s Thesis
next chapter The Standard Numbering φ of P(1)
Metadata
Title
Recursive and Recursively Enumerable Sets
Author
Prof. Dr. Klaus Weihrauch
Copyright Year
1987
Publisher
Springer Berlin Heidelberg
Book
Computability

Print ISBN: 978-3-642-69967-2

Electronic ISBN: 978-3-642-69965-8

Copyright Year: 1987

DOI
https://doi.org/10.1007/978-3-642-69965-8_9