Background
Davis, Martin David was born on March 8, 1928 in New York City. Son of Harry and Helen (Gotlieb) Davis.
http://www.amazon.com/gp/product/B010WESF8W/?tag=2022091-20
http://www.amazon.com/gp/product/B0000CK5UI/?tag=2022091-20
http://www.amazon.com/gp/product/B010DPUFK6/?tag=2022091-20
http://www.amazon.com/gp/product/B011YTC8GE/?tag=2022091-20
http://www.amazon.com/gp/product/B010DPUIV2/?tag=2022091-20
(This introductory text covers the key areas of computer s...)
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.
http://www.amazon.com/gp/product/0122063821/?tag=2022091-20
http://www.amazon.com/gp/product/1483237974/?tag=2022091-20
http://www.amazon.com/gp/product/B010TT7AJU/?tag=2022091-20
( Geared toward upper-level undergraduates and graduate s...)
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
http://www.amazon.com/gp/product/0486442292/?tag=2022091-20
http://www.amazon.com/gp/product/B000LZIIT4/?tag=2022091-20
http://www.amazon.com/gp/product/B011SIUWU0/?tag=2022091-20
http://www.amazon.com/gp/product/B00JHWSRIY/?tag=2022091-20
( "A clearly written, well-presented survey of an intrigu...)
"A clearly written, well-presented survey of an intriguing subject." — Scientific American. Classic text considers general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
http://www.amazon.com/gp/product/0486614719/?tag=2022091-20
mathematics and computer science educator
Davis, Martin David was born on March 8, 1928 in New York City. Son of Harry and Helen (Gotlieb) Davis.
Bachelor of Science, City College of New York, 1948; Master of Arts, Princeton, 1949; Doctor of Philosophy, Princeton, 1950.
Research instructor, University of Illinois, 1950-1952; member Institute Advanced Study, University of Illinois, 1952-1954; assistant professor, University of California at Davis, 1954-1955; assistant professor, Ohio State University, 1955-1956; assistant professor, then associate professor, Rensselaer Polytech. Institute, 1956-1959; member of faculty, New York University, 1959-1960, 65—; professor Grad School Arts and Sciences, New York University, since 1969; chair computer science department, New York University, 1988-1990; associate professor, Belfer Graduate School Science, Yeshiva U., 1960-1962; professor, Belfer Graduate School Science, Yeshiva U., 1962-1965, 70-71; visiting professor, Westfield College, U. London, 1968-1969; visiting professor, University of California, Berkeley, 1976-1977; visiting professor, University of California, Santa Barbara, 1978-1979. Consultant Bell Telephone laboratories, International Business Machines Corporation.
( Classic text considers general theory of computability,...)
( Geared toward upper-level undergraduates and graduate s...)
(This introductory text covers the key areas of computer s...)
(This introductory text covers the key areas of computer s...)
( "A clearly written, well-presented survey of an intrigu...)
(Martin Davis; Ron Sigal; Elaine J. Weyuker - Computabilit...)
Fellow American Association for the Advancement of Science. Member American Mathematics Society, Association Symbolic Logic, Mathematics Association American.
Married Virginia Whiteford Palmer, September 21, 1951. Children— Harold, Nathan.
