Benedikt Lowe – författare
1 977 kr
Läs direkt efter köp
In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical logic of the last 70 years. Moreover, the increasingly compelling necessity to deal with computability in the real world (such as computing on continuous data, biological computing, and physical models) has brought focus to new paradigms of computation that are based on biological and physical models. These models address questions of efficiency in a radically new way and even threaten to move the so-called Turing barrier, i.e. the line between the decidable and the un-decidable.
This book examines new developments in the theory and practice of computation from a mathematical perspective, with topics ranging from classical computability to complexity, from biocomputing to quantum computing. The book opens with an introduction by Andrew Hodges, the Turing biographer, who analyzes the pioneering work that anticipated recent developments concerning computation’s allegedly new paradigms. The remaining material covers traditional topics in computability theory such as relative computability, theory of numberings, and domain theory, in addition to topics on the relationships between proof theory, computability, and complexity theory. New paradigms of computation arising from biology and quantum physics are also discussed, as well as the computability of the real numbers and its related issues.
This book is suitable for researchers and graduate students in mathematics, philosophy, and computer science with a special interest in logic and foundational issues. Most useful to graduate students are the survey papers on computable analysis and biological computing. Logicians and theoretical physicists will also benefit from this book.
2 741 kr
Läs direkt efter köp
The notion of complexity is an important contribution of logic to theoretical computer science and mathematics. This volume attempts to approach complexity in a holistic way, investigating mathematical properties of complexity hierarchies at the same time as discussing algorithms and computational properties. A main focus of the volume is on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation. The papers in the volume are tied together by an introductory article describing abstract properties of complexity hierarchies.
This volume will be of great interest to both mathematical logicians and theoretical computer scientists, providing them with new insights into the various views of complexity and thus shedding new light on their own research.
255 kr
Skickas inom 5-8 vardagar
262 kr
Skickas inom 5-8 vardagar
1 367 kr
Läs direkt efter köp
This bookgathers the proceedings of the conference "Cultures of Mathematics andLogic," held in Guangzhou, China. The event was the third in a series ofinterdisciplinary, international conferences emphasizing the culturalcomponents of philosophy of mathematics and logic. It brought togetherresearchers from many disciplines whose work sheds new light on the diversityof mathematical and logical cultures and practices. In this context, thecultural diversity can be diachronical (different cultures in differenthistorical periods), geographical (different cultures in different regions), orsociological in nature.
1 367 kr
Läs direkt efter köp
1 379 kr
Läs direkt efter köp
1 367 kr
Läs direkt efter köp
1 367 kr
Läs direkt efter köp
687 kr
Läs direkt efter köp
708 kr
Läs direkt efter köp
Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this volume constitutes a selection of papers presented at the Internatonal Conference on Infinity in Logic and Computation, ILC 2007, held in Cape Town, South Africa, in November 2007.
The 7 revised papers presented together with 2 invited talks were carefully selected from 27 initial submissions during two rounds of reviewing and improvement. The papers address all aspects of infinity in automata theory, logic, computability and verification and focus on topics such as automata on infinite objects; combinatorics, cryptography and complexity; computability and complexity on the real numbers; infinite games and their connections to logic; logic, computability, and complexity in finitely presentable infinite structures; randomness and computability; transfinite computation; and verification of infinite state systems.
708 kr
Läs direkt efter köp
687 kr
Läs direkt efter köp
693 kr
Läs direkt efter köp
687 kr
Läs direkt efter köp
687 kr
Läs direkt efter köp
This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013. The 48 revised papers presented together with 1 invited lecture and 2tutorials were carefully reviewed and selected with an acceptance rate of under 31,7%. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing.
1 339 kr
Läs direkt efter köp
"Foundations of the Formal Sciences" (FotFS) is a series of interdisciplinary conferences in mathematics, philosophy, computer science and linguistics. The main goal is to reestablish the traditionally strong links between these areas of research that have been lost in the past decades.
The second conference in the series had the subtitle "Applications of Mathematical Logic in Philosophy and Linguistics" and brought speakers from all parts of the Formal Sciences together to give a holistic view of how mathematical methods can improve our philosophical and technical understanding of language and scientific discourse, ranging from the theoretical level up to applications in language recognition software.
Audience: This volume is of interest to all formal philosophers and theoretical linguists. In addition to that, logicians interested in the applications of their field and logic students in mathematics, computer science, philosophy and linguistics can use the volume to broaden their knowledge of applications of logic.