Advertisement
Published in:
2000 | OriginalPaper | Chapter
7. Computational Complexity
Author : Prof. Dr. Klaus Weihrauch
Published in: Computable Analysis
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Conventional complexity theory refines computability theory. Total recursive word functions f : Σ* → Σ* or recursive subsets X ⊆ Σ* are classified with respect to the resource which machines need to compute or decide them, respectively. By means of notations complexity can be transferred to other sets. Complexity theory has grown to an extensive field with numerous important results.