三民網路書店 / 搜尋結果

Designed for advanced undergraduate or beginning graduate students, this book provides a complete introduction to computability theory. This second edition includes new material on hyperarithmetical a

Computability has played a crucial role in mathematics and computer science, leading to the discovery, understanding and classification of decidable/undecidable problems, paving the way for the moder

The Annual European Meeting of the Association for Symbolic Logic, also known as the Logic Colloquium, is among the most prestigious annual meetings in the field. The current volume, with contributions from plenary speakers and selected special session speakers, contains both expository and research papers by some of the best logicians in the world. The most topical areas of current research are covered: valued fields, Hrushovski constructions (from model theory), algorithmic randomness, relative computability (from computability theory), strong forcing axioms and cardinal arithmetic, large cardinals and determinacy (from set theory), as well as foundational topics such as algebraic set theory, reverse mathematics, and unprovability. This volume will be invaluable for experts as well as those interested in an overview of central contemporary themes in mathematical logic.

Computability theory originated with the seminal work of Godel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and t

Alan Turing (1912–1954) made seminal contributions to mathematical logic, computation, computer science, artificial intelligence, cryptography and theoretical biology. In this volume, outstanding scientific thinkers take a fresh look at the great range of Turing's contributions, on how the subjects have developed since his time, and how they might develop still further. The contributors include Martin Davis, J. M. E. Hyland, Andrew R. Booker, Ueli Maurer, Kanti V. Mardia, S. Barry Cooper, Stephen Wolfram, Christof Teuscher, Douglas Richard Hofstadter, Philip K. Maini, Thomas E. Woolley, Eamonn A. Gaffney, Ruth E. Baker, Richard Gordon, Stuart Kauffman, Scott Aaronson, Solomon Feferman, P. D. Welch and Roger Penrose. These specially commissioned essays will provoke and engross the reader who wishes to understand better the lasting significance of one of the twentieth century's deepest thinkers.

Together, Sets and Proofs and its sister volume Models and Computability will provide readers with a comprehensive guide to mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.

Together, Models and Computability and its sister volume Sets and Proofs will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.

There are few notions as fundamental to contemporary science as those of computability and modelling. Computability and Models attempts to make some of the exciting and important new research developm

This book constitutes the refereed proceedings of the Turing Centenary Conference and the 8th Conference on Computability in Europe, CiE 2012, held in Cambridge, UK, in June 2012. The 53 revised paper

This superb exposition of a complex subject examines new developments in the theory and practice of computation from a mathematical perspective, with topics ranging from classical computability to com

"The fact remains that everyone who taps at a keyboard, opening a spreadsheet or a word-processing program, is working on an incarnation of a Turing machine." - Time This new and exciting book, sched

Contingent on funding being available, a Festschrift will be held in honor of Dr. John Yuille’s career as a Forensic Psychologist. He has become one of the most visible and respected Canadian psycholo

This book constitutes the refereed proceedings of the 9th International Conference on Theory and Applications of Models of Computation, TAMC 2012, held in Beijing, China, in May 2012. The conference w

This book questions the relevance of computation to the physical universe. Our theories deliver computational descriptions, but the gaps and discontinuities in our grasp suggest a need for continued d

This book constitutes the refereed proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, TAMC 2014, held in Chennai, India, in April 2014. The 27 revised full