Benedikt Löwe – författare
Visar alla böcker från författaren Benedikt Löwe. Handla med fri frakt och snabb leverans.
27 produkter
27 produkter
Inbunden, Engelska, 2007
1 605 kr
Skickas inom 10-15 vardagar
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.
Inbunden, Engelska, 2003
1 073 kr
Skickas inom 10-15 vardagar
This is a series of interdisciplinary conferences in mathematics, philosophy, computer science and linguistics. The main goal is to re-establish 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.
Inbunden, Engelska, 2005
2 138 kr
Skickas inom 10-15 vardagar
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.
Häftad, Engelska, 2010
1 605 kr
Skickas inom 10-15 vardagar
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.
Häftad, Engelska, 2013
229 kr
Skickas inom 5-8 vardagar
Inbunden, Engelska, 2014
322 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2022
195 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2022
215 kr
Skickas inom 5-8 vardagar
Inbunden, Engelska, 2007
426 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2008
264 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2007
295 kr
Skickas inom 5-8 vardagar
Del 11 - Philosophy
PhiMSAMP
Philosophy of Mathematics. Sociological Aspects and Mathematical Practice
Häftad, Engelska, 2010
275 kr
Skickas inom 5-8 vardagar
Inbunden, Engelska, 2016
1 073 kr
Skickas inom 10-15 vardagar
This bookgathers the proceedings of the conference "Cultures of Mathematics andLogic," held in Guangzhou, China. In this context, thecultural diversity can be diachronical (different cultures in differenthistorical periods), geographical (different cultures in different regions), orsociological in nature.
Häftad, Engelska, 2018
1 073 kr
Skickas inom 10-15 vardagar
This bookgathers the proceedings of the conference "Cultures of Mathematics andLogic," held in Guangzhou, China. In this context, thecultural diversity can be diachronical (different cultures in differenthistorical periods), geographical (different cultures in different regions), orsociological in nature.
Häftad, Engelska, 2005
1 105 kr
Skickas inom 10-15 vardagar
CiE 2005: New Computational Paradigms http://www. illc. uva. nl/CiE/ ThecooperationComputabilityinEurope (CiE)isaninformalEuropeannetwork covering computability in theoretical computer science and mathematical logic, ranging from application of novel approaches to computation to set-theoretic analysesofin?nitarycomputingmodels. Thecooperationconsistsofelevenmain nodesandincludesover400researchers;itiscoordinatedfromLeeds(UK). More information about CiE can be found in Barry Cooper's introductory paper to this volume (p. 1) and at http://www. amsta. leeds. ac. uk/pure/staff/cooper/cie. html CiE 2005 was a conference on the special topic "New Computational Pa- digms" and was held in Amsterdam in June 2005. It was initiated by and served as a focus point for the informal cooperation CiE. The topic of "New Com- tational Paradigms" covers connections between computation and physical s- tems (e. g. , quantum computation, neural nets, molecular computation) but also higher mathematical models of computation (e. g. , in?nitary computation or real computation). Computability theory is central to large areas of theoretical computer science and mathematical logic.Traditionally, the computational model of the Turing machine (or mathematically equivalent models) has been used to reason about computation or computability. For general computability inquiries (with - bounded resources), the choice of the model of computation hardly matters (this fact is encapsulated in the so-called "Church-Turing thesis"); this could change as soon as questions of e?ciency are investigated.
Häftad, Engelska, 2006
1 105 kr
Skickas inom 10-15 vardagar
CiE 2006: Logical Approaches to Computational Barriers Swansea, Wales, June 30 - July 5, 2006 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory or relativity. Computations may be very general, depending upon the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, and computational learning. Applications are everywhere, especially, in algebra, analysis and geometry, or data types and programming. This volume, Logical Approaches to Computational Barriers, is the proce- ings of the second in a series of conferences of CiE that was held at the Depa- ment of Computer Science, Swansea University, 30 June - 5 July, 2006.
Häftad, Engelska, 2008
1 073 kr
Skickas inom 10-15 vardagar
CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15–20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15–20, 2008.
Häftad, Engelska, 2007
1 105 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the Third International Conference on Computability in Europe, CiE 2007, held in Sienna, Italy, in June 2007. The 50 revised full papers presented together with 36 invited papers were carefully reviewed and selected from 167 submissions.
Häftad, Engelska, 2009
556 kr
Skickas inom 10-15 vardagar
CiE 2009: Mathematical Theory and Computational Practice Heidelberg, Germany, July 19-24, 2009 After several years of research activity, the informal cooperation "C- putability in Europe" decided to take a more formal status at their meeting in Athens in June 2008: the Association for Computability in Europe was founded to promote the development, particularly in Europe, of computability-related science, ranging over mathematics, computer science, and applications in va- ous natural and engineering sciences such as physics and biology, including the promotion of the study of philosophy and history of computing as it relates to questionsofcomputability. As mentioned,this associationbuilds ontheinformal network of European scientists working on computability theory that had been supporting the conference series CiE-CS overthe years,and nowbecame its new home. The aims of the conference series remain unchanged: to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines.Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations.
Häftad, Engelska, 2009
556 kr
Skickas inom 10-15 vardagar
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.
Häftad, Engelska, 2010
556 kr
Skickas inom 10-15 vardagar
CiE 2010: Programs, Proofs, Processes Ponta Delgada, Azores, Portugal, June 30-July 4 2010 The last few years, starting in 2005 with out inaugural conference in Amst- dam, have seen a development from an informal cooperation via an increasingly established conference series to an association, founded in 2008. While the or- nization formofComputability in Europe (CiE) may havechanged, the scienti?c scope is still the same and as interdisciplinary and innovative as it was six year ago when we held the ?rst conference. CiE aims to promote computabili- related science in its broadest sense, including mathematics, computer science, applications in various natural and engineering sciences (e. g. , physics, biology, computer engineering), and also reaches out to meta-studies such as the history and philosophy of computing. Researchers at CiE conferences wish to advance our theoretical understanding of what can and cannot be computed, by any means of computation. CiE 2010 was the sixth conference of the series, held in a geographically unique anddramatic location,Europe's mostwesterlyoutpost,atthe University ofAzoresinPontaDelgada,Portugal.ThethemeofCiE2010"Programs,Proofs, Processes" points to the usual CiE synergy of computer science, mathematics and logic, with important computability-theoretic connections to science and the real universe. Formal systems, attendant proofs, and the possibility of their computer generation and manipulation (for instance, into programs) have been changing a whole spectrum of disciplines.
Häftad, Engelska, 2010
556 kr
Skickas inom 10-15 vardagar
This volume is conceived as a rami?cation of the eighth conference on Logic and the Foundations of the Theory of Games and Decisions (LOFT8), which took placein Amsterdam,inJuly2008.Inall,61papersweresubmitted to thisevent, of which 48 were presented. This volume is based on a selection of the presented papers and the invited talks: they survived a thorough and lengthy reviewing process. The LOFT conferences have been a regular biannual event since 1994. The ?rstconference washosted by the Centre Internationalde RecherchesMathe- tiques in Marseille (France),the next four took place at the InternationalCentre for Economic Research in Turin (Italy), the sixth conference was hosted by the Graduate School of Management in Leipzig (Germany), the seventh took place at the University of Liverpool (UK) and LOFT8 was organized at the ILLC in 1 Amsterdam. The LOFT conferences are interdisciplinary events that bring together - searchers from a variety of ?elds: computer science, economics, game theory, linguistics, logic, multi-agent systems, psychology, philosophy, social choice and statistics. Its focus is on the general issue of rationality and agency.In the last decade, there has been a ?oroushing activity in exactly the kind of areas that LOFT aims to address, which is demonstrated by not only the number of s- missions to LOFT8, but also the fact that the conference is becoming more and more a home for a large group of researchers, rather than a host for passersby from di?erent disciplines.
Häftad, Engelska, 2011
540 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011. The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%.The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.
Häftad, Engelska, 2012
540 kr
Skickas inom 10-15 vardagar
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 papers presented together with 6 invited lectures were carefully reviewed and selected with an acceptance rate of under 29,8%. The CiE 2012 Turing Centenary Conference will be remembered as a historic event in the continuing development of the powerful explanatory role of computability across a wide spectrum of research areas. The papers presented at CiE 2012 represent the best of current research in the area, and forms a fitting tribute to the short but brilliant trajectory of Alan Mathison Turing. 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.
Häftad, Engelska, 2013
540 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013.
Häftad, Engelska, 2010
1 073 kr
Skickas inom 10-15 vardagar
"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.
Häftad, Engelska, 2010
2 138 kr
Skickas inom 10-15 vardagar
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.