Turing maschine

Department of Mathematics Trent University, 1991, -186 pp. This is a text for a problem-oriented undergraduate course in mathematical logic. It covers the basics of propositional and first-order logic through the Soundness, Completeness, and Compactness Theorems. Volume II, Computation, covers the basics of computability using Turing machines and recursive functions, the Incompleteness Theorems, and complexity theory through the P and NP. It co...

Издательство Springer, 1999, -128 pp. Having published four books on this subject, why a fifth? Because there’s something new: I compare and contrast G?del’s, Turing’s and my work in a very simple and straight-forward manner using LISP. Up to now I never wanted to examine G?del’s and Turing’s work too closely - I wanted to develop my own viewpoint. But there is no longer any danger. So I set out to explain the mathematical essence of three very...

Routledge, 1999. - 128 pages. First published in the most ambitious international philosophy project for a generation; the Routledge Encyclopedia of Philosophy. Logic from A to Z is a unique glossary of terms used in formal logic and the philosophy of mathematics. Over 500 entries include key terms found in the study of. * Logic: Argument, Turing Machine, Variable. * Set and model theory: Isomorphism, Function. * Computability theory: Algor...

Prentice Hall, 2002. - 341 Pages. This book invites the reader to explore abstractions that are crucial to computer science. The authors bring a sense of excitement to logics, formal languages and automata-motivating topics by linking them to computing and to computational applications, sometime with whole chapters. They achieve exceptional clarity through a plethora of examples and figures, yet without-losing sight of, and indeed celebrating, t...

Издательство Cambridge University Press, 2005, -173 pp. In 1931, the young Kurt G?del published his First and Second Incompleteness Theorems; very often, these are simply referred to as ‘G?del’s Theorems’. His startling results settled (or at least, seemed to settle) some of the crucial questions of the day concerning the foundations of mathematics. They remain of the greatest significance for the philosophy of mathematics – though just what tha...