|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Barry S. Cooper , Sergei S. GoncharovPublisher: Springer Science+Business Media Imprint: Kluwer Academic/Plenum Publishers Edition: 2003 ed. Dimensions: Width: 15.50cm , Height: 3.00cm , Length: 23.50cm Weight: 0.800kg ISBN: 9780306474002ISBN 10: 030647400 Pages: 375 Publication Date: 31 January 2003 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: Awaiting stock ![]() The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you. Table of ContentsTruth-Table Complete Computably Enumerable Sets.- Completeness and Universality of Arithmetical Numberings.- Algebraic Properties of Rogers Semilattices of Arithmetical Numberings.- Isomorphism Types and Theories of Rogers Semilattices of Arithmetical Numberings.- Computability over Topological Structures.- Incomputability In Nature.- Gems in the Field of Bounded Queries.- Finite End Intervals in Definable Quotients of ?.- A Tour of Robust Learning.- On Primitive Recursive Permutations.- On Self-Embeddings of Computable Linear Orders.- Definable Relations on the Computably Enumerable Degrees.- Quasi-Degrees of Recursively Enumerable Sets.- Positive Structures.- Local Properties of the Non-Total Enumeration Degrees.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |