Rod Downey – författare
Visar alla böcker från författaren Rod Downey. Handla med fri frakt och snabb leverans.
7 produkter
7 produkter
Inbunden, Engelska, 2020
1 668 kr
Skickas inom 5-8 vardagar
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Häftad, Engelska, 2020
761 kr
Skickas inom 5-8 vardagar
Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields.In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers.Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Häftad, Engelska, 2024
649 kr
Skickas inom 10-15 vardagar
More precisely, it examines computability theory and computational complexity theory. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space.
Inbunden, Engelska, 2001
1 541 kr
Skickas inom 5-8 vardagar
The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra.Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis.The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.
Häftad, Engelska, 2004
558 kr
Skickas inom 10-15 vardagar
Thecentralchallengeoftheoreticalcomputerscienceistodeploymathematicsin waysthatservethecreationofusefulalgorithms. Inrecentyearstherehasbeena growinginterest in the two-dimensionalframework of parameterizedcomplexity, where, in addition to the overall input size, one also considers a parameter,with a focus on how these two dimensions interact in problem complexity. This book presents the proceedings of the 1st InternationalWorkshopon - rameterized and Exact Computation (IWPEC 2004,http://www. iwpec. org), which took place in Bergen, Norway, on September 14-16, 2004. The workshop was organized as part of ALGO 2004. There were seven previous workshops on the theory and applications of parameterized complexity. The ?rst was - ganized at the Institute for the Mathematical Sciences in Chennai, India, in September, 2000. The second was held at Dagstuhl Castle, Germany, in July, 2001. In December, 2002, a workshop on parameterized complexity was held in conjunction with the FST-TCS meeting in Kanpur, India. A second Dagstuhl workshop on parameterized complexity was held in July, 2003.Another wo- shoponthesubjectwasheldinOttawa,Canada,inAugust,2003,inconjunction with the WADS 2003 meeting. There have also been two Barbados workshops on applications of parameterized complexity. In response to the IWPEC 2004 call for papers, 47 papers were submitted, and from these the programcommittee selected 25 for presentation at the wo- shop. Inaddition,invitedlectureswereacceptedbythedistinguishedresearchers Michael Langston and Gerhard Woeginger.
Inbunden, Engelska, 2025
1 370 kr
Skickas inom 3-6 vardagar
This volume presents the combined proceedings of two major conferences in mathematical logic — the 16th Asian Logic Conference (ALC) and the 14th International Conference on Computability, Complexity and Randomness (CCR) — held at Nazarbayev University, Astana, Kazakhstan, from 17-21 June 2019 and 23-25 June 2019, respectively. ALC is a prominent international event promoting research and collaboration in logic across the Asia-Pacific region, featuring developments in mathematical logic, logic in computer science, and philosophical logic. CCR focuses on algorithmic information theory, Kolmogorov complexity, and their intersections with computability, complexity theory, and reverse mathematics.This collection brings together leading voices in the field, offering fresh perspectives and state-of-the-art research in logic, computability, set theory, and model theory. It is an essential resource for researchers, scholars, and students interested in contemporary developments in mathematical logic and its applications.
Del 42 - Lecture Notes in Logic
Turing's Legacy
Developments from Turing's Ideas in Logic
Inbunden, Engelska, 2014
1 985 kr
Tillfälligt slut
Alan Turing was an inspirational figure who is now recognised as a genius of modern mathematics. In addition to leading the Allied forces' code-breaking effort at Bletchley Park in World War II, he proposed the theoretical foundations of modern computing and anticipated developments in areas from information theory to computer chess. His ideas have been extraordinarily influential in modern mathematics and this book traces such developments by bringing together essays by leading experts in logic, artificial intelligence, computability theory and related areas. Together, they give insight into this fascinating man, the development of modern logic, and the history of ideas. The articles within cover a diverse selection of topics, such as the development of formal proof, differing views on the Church-Turing thesis, the development of combinatorial group theory, and Turing's work on randomness which foresaw the ideas of algorithmic randomness that would emerge many years later.