Cantitate/Preț
Produs
Total produse
Vezi coșul
Complexity, Logic, and Recursion Theory de Andrea Sorbi

Complexity, Logic, and Recursion Theory: Lecture Notes in Pure and Applied Mathematics

Autor Andrea Sorbi
en Limba Engleză Hardback – 7 iun 2019
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
Citește tot Restrânge

Din seria Lecture Notes in Pure and Applied Mathematics

Preț: 120925 lei

Preț vechi: 132885 lei
-9% Nou

Puncte Express: 1814
Preț estimativ în valută:
23145€ • 24058$ • 19172£

Carte disponibilă

Livrare economică 14-28 ianuarie 25
Livrare express 31 decembrie 24 - 04 ianuarie 25 pentru 3063 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781138404106
ISBN-10: 1138404101
Pagini: 380
Dimensiuni: 178 x 254 x 27 mm
Greutate: 0.45 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
Seria Lecture Notes in Pure and Applied Mathematics

Locul publicării:Boca Raton, United States

Public țintă

Professional

Cuprins

Preface, Contributors, Resource-Bounded Measure and Randomness, Degree Structures in Local Degree Theory, Compressibility of Infinite Binary Sequences, Beyond Gödel’s Theorem: The Failure to Capture Information Content, Progressions of Theories of Bounded Arithmetic, On Presentations of Algebraic Structures, Witness-Isomorphic Reductions and Local Search, A Survey of Inductive Inference with an Emphasis on Queries, A Uniformity of Degree Structures, Short Course on Logic, Algebra, and Topology, The Enumeration Degrees of the ∑02 Sets, The Convenience of Tilings

Notă biografică

Andrea Sorbi is Associate Professor in the Department of Mathematics at the University of Siena, Italy. The author or coauthor of several key professional papers and book chapters on computability theory and mathematical logic, he is a member of the American Mathematical Society and the Association for Symbolic Logic, among other organizations. Dr. Sorbi received the Ph.D. degree (1987) in mathematics from the City University of New York, New York.

Descriere

Presents coverage of research at the interface of logic, computability theory, and theoretical computer science. This book integrates two approaches to computability.