epub @ SUB HH

03Dxx Computability and recursion theory ( 0 Dok. )

• 03D03 Thue and Post systems, etc. ( 0 Dok. )
• 03D05 Automata and formal grammars in connection with logical questions ( 0 Dok. )
• 03D10 Turing machines and related notions ( 0 Dok. )
• 03D15 Complexity of computation ( 0 Dok. )
• 03D20 Recursive functions and relations, subrecursive hierarchies ( 0 Dok. )
• 03D25 Recursively (computably) enumerable sets and degrees ( 0 Dok. )
• 03D28 Other Turing degree structures ( 0 Dok. )
• 03D30 Other degrees and reducibilities ( 0 Dok. )
• 03D35 Undecidability and degrees of sets of sentences ( 0 Dok. )
• 03D40 Word problems, etc. ( 0 Dok. )
• 03D45 Theory of numerations, effectively presented structures ( 0 Dok. )
• 03D50 Recursive equivalence types of sets and structures, isols ( 0 Dok. )
• 03D55 Hierarchies ( 0 Dok. )
• 03D60 Computability and recursion theory on ordinals, admissible sets, etc. ( 0 Dok. )
• 03D65 Higher-type and set recursion theory ( 0 Dok. )
• 03D70 Inductive definability ( 0 Dok. )
• 03D75 Abstract and axiomatic computability and recursion theory ( 0 Dok. )
• 03D80 Applications of computability and recursion theory ( 0 Dok. )
• 03D99 None of the above, but in this section ( 0 Dok. )