Author: Richard L. Epstein
Publisher: Chapman and Hall/CRC
ISBN: 0534103561
Release Date: 1989-11-09
Genre: Mathematics

An introduction to recursion theory and particularly to the theory of computing, including fourteen readings by Hilbert, Godel, Turing, Post, Church, and others along with a discussion of issues such as self-reference and infinite sets. Annotation copyrighted by Book News, Inc., Portland, OR

Computability Computable Functions Logic and the Foundations of Math

Author: Richard L. Epstein
Publisher: Springer
ISBN: 0534103561
Release Date: 1989-11-09
Genre: Mathematics

An introduction to recursion theory and particularly to the theory of computing, including fourteen readings by Hilbert, Godel, Turing, Post, Church, and others along with a discussion of issues such as self-reference and infinite sets. Annotation copyrighted by Book News, Inc., Portland, OR

Martin Davis on Computability Computational Logic and Mathematical Foundations

Author: Eugenio G. Omodeo
Publisher: Springer
ISBN: 9783319418421
Release Date: 2017-01-27
Genre: Philosophy

This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability. The individual contributions touch on most of the core aspects of Davis’ work and set it in a contemporary context. They analyse, discuss and develop many of the ideas and concepts that Davis put forward, including such issues as contemporary satisfiability solvers, essential unification, quantum computing and generalisations of Hilbert’s tenth problem. The book starts out with a scientific autobiography by Davis, and ends with his responses to comments included in the contributions. In addition, it includes two previously unpublished original historical papers in which Davis and Putnam investigate the decidable and the undecidable side of Logic, as well as a full bibliography of Davis’ work. As a whole, this book shows how Davis’ scientific work lies at the intersection of computability, theoretical computer science, foundations of mathematics, and philosophy, and draws its unifying vision from his deep involvement in Logic.

Handbook of Computability Theory

Author: E.R. Griffor
Publisher: Elsevier
ISBN: 0080533043
Release Date: 1999-10-01
Genre: Mathematics

The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of recent results (due to the complexity of the methods and proofs themselves). Hence the variation in level of presentation from chapter to chapter only reflects the conceptual situation itself. One example of this is the collective efforts to develop an acceptable theory of computation on the real numbers. The last two decades has seen at least two new definitions of effective operations on the real numbers.

The Foundations of Computability Theory

Author: Borut Robič
Publisher: Springer
ISBN: 9783662448083
Release Date: 2015-09-14
Genre: Computers

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism; in Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability; in Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science.

Logic Foundations of Mathematics and Computability Theory

Author: Robert E. Butts
Publisher: Springer Science & Business Media
ISBN: 9789401011389
Release Date: 2012-12-06
Genre: Science

The Fifth International Congress of Logic, Methodology and Philosophy of Science was held at the University of Western Ontario, London, Canada, 27 August to 2 September 1975. The Congress was held under the auspices of the International Union of History and Philosophy of Science, Division of Logic, Methodology and Philosophy of Science, and was sponsored by the National Research Council of Canada and the University of Western Ontario. As those associated closely with the work of the Division over the years know well, the work undertaken by its members varies greatly and spans a number of fields not always obviously related. In addition, the volume of work done by first rate scholars and scientists in the various fields of the Division has risen enormously. For these and related reasons it seemed to the editors chosen by the Divisional officers that the usual format of publishing the proceedings of the Congress be abandoned in favour of a somewhat more flexible, and hopefully acceptable, method of pre sentation. Accordingly, the work of the invited participants to the Congress has been divided into four volumes appearing in the University of Western Ontario Series in Philosophy of Science. The volumes are entitled, Logic, Foundations of Mathematics and Computability Theory, Foun dational Problems in the Special Sciences, Basic Problems in Methodol ogy and Linguistics, and Historical and Philosophical Dimensions of Logic, Methodology and Philosophy of Science.

Naive Mengenlehre

Author: Paul R. Halmos
Publisher: Vandenhoeck & Ruprecht
ISBN: 3525405278
Release Date: 1976
Genre: Arithmetic

An Introduction to G del s Theorems

Author: Peter Smith
Publisher: Cambridge University Press
ISBN: 1139465937
Release Date: 2007-07-26
Genre: Mathematics

In 1931, the young Kurt Gödel published his First Incompleteness Theorem, which tells us that, for any sufficiently rich theory of arithmetic, there are some arithmetical truths the theory cannot prove. This remarkable result is among the most intriguing (and most misunderstood) in logic. Gödel also outlined an equally significant Second Incompleteness Theorem. How are these Theorems established, and why do they matter? Peter Smith answers these questions by presenting an unusual variety of proofs for the First Theorem, showing how to prove the Second Theorem, and exploring a family of related results (including some not easily available elsewhere). The formal explanations are interwoven with discussions of the wider significance of the two Theorems. This book will be accessible to philosophy students with a limited formal background. It is equally suitable for mathematics students taking a first course in mathematical logic.

Generative Social Science Studies in Agent Based Computational Modeling

Author: Joshua M. Epstein
Publisher: Princeton University Press
ISBN: 9781400842872
Release Date: 2012-01-02
Genre: Business & Economics

Agent-based computational modeling is changing the face of social science. In Generative Social Science, Joshua Epstein argues that this powerful, novel technique permits the social sciences to meet a fundamentally new standard of explanation, in which one "grows" the phenomenon of interest in an artificial society of interacting agents: heterogeneous, boundedly rational actors, represented as mathematical or software objects. After elaborating this notion of generative explanation in a pair of overarching foundational chapters, Epstein illustrates it with examples chosen from such far-flung fields as archaeology, civil conflict, the evolution of norms, epidemiology, retirement economics, spatial games, and organizational adaptation. In elegant chapter preludes, he explains how these widely diverse modeling studies support his sweeping case for generative explanation. This book represents a powerful consolidation of Epstein's interdisciplinary research activities in the decade since the publication of his and Robert Axtell's landmark volume, Growing Artificial Societies. Beautifully illustrated, Generative Social Science includes a CD that contains animated movies of core model runs, and programs allowing users to easily change assumptions and explore models, making it an invaluable text for courses in modeling at all levels.

Grundlagen der Mathematik I

Author: David Hilbert
Publisher: Springer-Verlag
ISBN: 9783642868948
Release Date: 2013-03-08
Genre: Mathematics

Die Leitgedanken meiner Untersuchungen über die Grundlagen der Mathematik, die ich - anknüpfend an frühere Ansätze - seit 1917 in Besprechungen mit P. BERNAYS wieder aufgenommen habe, sind von mir an verschiedenen Stellen eingehend dargelegt worden. Diesen Untersuchungen, an denen auch W. ACKERMANN beteiligt ist, haben sich seither noch verschiedene Mathematiker angeschlossen. Der hier in seinem ersten Teil vorliegende, von BERNAYS abgefaßte und noch fortzusetzende Lehrgang bezweckt eine Darstellung der Theorie nach ihren heutigen Ergebnissen. Dieser Ergebnisstand weist zugleich die Richtung für die weitere Forschung in der Beweistheorie auf das Endziel hin, unsere üblichen Methoden der Mathematik samt und sonders als widerspruchsfrei zu erkennen. Im Hinblick auf dieses Ziel möchte ich hervorheben, daß die zeit weilig aufgekommene Meinung, aus gewissen neueren Ergebnissen von GÖDEL folge die Undurchführbarkeit meiner Beweistheorie, als irrtüm lich erwiesen ist. Jenes Ergebnis zeigt in der Tat auch nur, daß man für die weitergehenden Widerspruchsfreiheitsbeweise den finiten Stand punkt in einer schärferen Weise ausnutzen muß, als dieses bei der Be trachtung der elementaren Formallsmen erforderlich ist. Göttingen, im März 1934 HILBERT Vorwort zur ersten Auflage Eine Darstellung der Beweistheorie, welche aus dem HILBERTschen Ansatz zur Behandlung der mathematisch-logischen Grundlagenpro bleme erwachsen ist, wurde schon seit längerem von HILBERT ange kündigt.


Author: Arnold Oberschelp
ISBN: 341116171X
Release Date: 1993
Genre: Recursion theory

The Annotated Turing

Author: Charles Petzold
Publisher: John Wiley & Sons
ISBN: 9780470229057
Release Date: 2008-06-16
Genre: Computers

Provides an expansion of Turing's original paper, a brief look at his life, and information on the Turing machine and computability topics.