We use cookies to provide essential features and services. By using our website you agree to our use of cookies .

×

Warehouse Stock Clearance Sale

Grab a bargain today!

Recursion Theory Week
By

Rating

Product Description
Product Details

Table of Contents

Honest polynomial reductions and exptally sets.- On the structure of degrees below O?.- Positive solutions to Post's problem.- The metamathematics of Fraisse's order type conjecture.- Enumeration reducibility, nondeterministic computations and relative computability of partial functions.- Notes on the O? priority method with special attention to density results.- Array nonrecursive sets and multiple permitting arguments.- Superbranching degrees.- A direct construction of a minimal recursively enumerable truth-table degree.- ?2-induction and the construction of a high degree.- Undecidability and initial segments of the wtt-degrees ?0?.- Randomness and generalizations of fixed point free functions.- Recursive enumeration without repetition revisited.- Priority arguments using iterated trees of strategies.- On the relationship between the complexity, the degree, and the extension of a computable set.- Polynomially isolated sets.- A characterization of effective topological spaces.

Promotional Information

Springer Book Archives

Ask a Question About this Product More...
Write your question below:
Look for similar items by category
People also searched for
Item ships from and is sold by Fishpond World Ltd.
Back to top