This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page. * The number of exercises included has more than tripled. * Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.

Computability, complexity, and languages: Fundamentals of theoretical computer science (Computer science and applied mathematics)

Science & Math

Davis, Martin

Mathematics

Academic Press

Computability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Computers & Technology

Sigal, Ron

Weyuker, Elaine J.

Computer Science

Morgan Kaufmann

Computers are ubiquitous yet to many they remain objects of irreducible mystery. This text looks at the question of how today's computers can perform such a variety of tasks if computing is just glorified arithmetic. The author illustrates how the answer lies in the fact that computers are essentially engines of logic and that their hardware and software embody concepts developed over centuries by logicians. "Engines of Logic" gives the reader a clear explanation of how and why computers work.

Engines of Logic: Mathematicians & the Origin of the Computer

History

W.W.Norton&Company

Geared toward upper-level undergraduates and graduate students, this text explores the applications of nonstandard analysis without assuming any knowledge of mathematical logic. It develops the key techniques of nonstandard analysis at the outset from a single, powerful construction; then, beginning with a nonstandard construction of the real number system, it leads students through a nonstandard treatment of the basic topics of elementary real analysis, topological spaces, and Hilbert space. Important topics include nonstandard treatments of equicontinuity, nonmeasurable sets, and the existence of Haar measure. The focus on compact operators on a Hilbert space includes the Bernstein-Robinson theorem on invariant subspaces, which was first proved with nonstandard methods. Ever mindful of the needs of readers with little background in these subjects, the text offers a straightforward treatment that provides a strong foundation for advanced studies of analysis

Applied Nonstandard Analysis (Pure and Applied Mathematics)

John Wiley&Sons, Inc.

A lavishly illustrated, magnificently produced celebration of Byron Nelson, who was recently honored with the PGA's Lifetime Achievement Award--from The American Golfer, Inc., creators of the hugely successful book "The Hogan Mystique." 
Byron Nelson, now 84 years old and living in Roanoke, Texas, set one of the most extraordinary records in sports history. In 1945 he won 18 tournaments, including 11 in a row. His record still stands today. Credited with developing the modern swing and recognized as one of the finest putters of all time, golf's true "gentleman" is a much-admired hero in the golfing world. Yet, little has been written about him and his remarkable techniques. Until now.
 "Byron Nelson" presents the full story of Nelson's life and career, chronicling his path from his days as a caddie for Ben Hogan in Fort Worth, Texas, through the 54 PGA events he won as a professional golfer. With a foreword by Ben Crenshaw and essays by renowned sportswriters Dave Anderson, Nick Seitz, and Dan Jenkins and golfer Tom Watson, as well as analysis by Ken Venturi, and stats by Sal Johnson, "Byron Nelson" pays tribute to Nelson's lasting impact on the game.
Printed in Italy in six colors throughout and featuring elegant black-and-white photographs and a special eight-page double gatefold, "Byron Nelson" is the perfect gift for anybody who loves golf and appreciates the history of the game.

Byron Nelson

Biographies & Memoirs

American Geological Institute

Byron Nelson, Limited Edition

Broadway

Collection of marvelous black-and-white photographs that Jules Alexander took of Ben Hogan at the 1959 US Open at Winged Foot.

The Hogan Mystique

The name Bobby Jones brings to mind not only a legendary golfer but also a legendary era in the history of golf. Robert Tyre Jones, Jr. earned 23 tournament victories in a 13-year competitive period that ended in 1930 when he was just 28 years old. He was the only player ever to carry off the Grand Slam, winning all four majors in one year, and he co-designed the Augusta National course. Jones also set a standard for character and was so committed to fair play that he called penalties on himself, causing him to lose two major competitions. Bobby Jones combines some of the greatest voices in sports writing with photographs so dynamic you can almost hear the astonished crowds cheering Jones on. Close-ups demonstrating Jones's technique are also included. Printed in Italy in six colors, including two eight-page double gatefolds and approximately 150 photographs, this elegant oversize edition is a cornerstone volume for every golf lover's library.

Bobby Jones: THE GREATEST OF THEM ALL

Arts & Photography

Photography & Video

The Universal Computer: The Road from Leibniz to Turing, Third Edition

The breathtakingly rapid pace of change in computing makes it easy to overlook the pioneers who began it all. The Universal Computer: The Road from Leibniz to Turing explores the fascinating lives, ideas, and discoveries of seven remarkable mathematicians. It tells the stories of the unsung heroes of the computer age – the logicians.

The Universal Computer

CRC-Press

This anthology of fundamental papers dealing with undecidability and unsolvability begins with del's epoch-making paper of 1931. This paper demonstrated for the first time that systems of logic--no matter how powerful--could never admit proofs of all true assertions of arithmetic. Included in this outstanding volume are the basic papers of del, Church, Turing, and Post in which the class of recursive functions was singled out and seen to be just the class of functions that can be computed by finite algorithms. Also presented is the work of Church, Turing, and Post in which problems from the theory of abstract computing machines, from mathematical logic, and finally from algebra are shown to be unsolvable in the sense that there is no finite algorithm for dealing with them. Finally, the book presents the work of Kleene and of Post initiating the classification theory of unsolvable problems. Already the standard reference work on the subject, The Undecidable is also ideally suited as a text or supplementary text for courses in logic, philosophy, and foundations of mathematics.

Undecidable: Basic Papers on Problems Propositions Unsolvable Problems and Computable Functions

Raven Pr

See the best price to sell, buy, or rent books by Davis, Martin. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Davis, Martin