Bargain finder

Use this tool to find book bargains on Amazon Marketplace. It works best on the "my areas of interest" setting, but you need to specify your areas of interest first. You might also want to change your shopping locale (currently the US locale).

Note: the best bargains on this page tend to go fast; the prices shown can be inaccurate because of this.

Settings


 Area(s)

 Offer type

 Sort by
($)
 Max price
% off
 Min discount

 Min year

 Added since

 Pro authors only

 

  1. Arto Salomaa (1985). Computation and Automata. Cambridge University Press.
    This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
  2. Jaakko Hintikka (1970). Information and Inference. D. Reidel.
  3. E. Börger (1989). Computability, Complexity, Logic. New York, N.Y., U.S.A.Elsevier Science Pub. Co..
    The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
    Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel’s incompleteness theorems, but also a large number of optional topics, from Turing’s theory of computability to Ramsey’s theorem. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a (...)
  5. N. D. Jones (1997). Computability and Complexity: From a Programming Perspective Vol. 21. Mit Press.
    This makes his book especially valuable." -- Yuri Gurevich, Professor of Computer Science, University of Michigan Computability and complexity theory should be of central concern to practitioners as well as theorists.
  6. Benjamin Woolley (1992). Virtual Worlds: A Journey in Hype and Hyperreality. Blackwell.
    In Virtual Worlds, Benjamin Woolley examines the reality of virtual reality.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. C. Foster (1990). Algorithms, Abstraction and Implementation. Academic Press.
  8. Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.
    Machine generated contents note: 1. The Computability Concept;2. General Recursive Functions;3. Programs and Machines;4. Recursive Enumerability;5. Connections to Logic;6. Degrees of Unsolvability;7. Polynomial-Time Computability;Appendix: Mathspeak;Appendix: Countability;Appendix: Decadic Notation;.
  9. Melvin Fitting (1987). Computability Theory, Semantics, and Logic Programming. Clarendon Press.
    This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great interest. Fitting considers the relation of PROLOG logic programming to the LISP type of language.
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. John Budd (2008). Self-Examination: The Present and Future of Librarianship. Libraries Unlimited.
    Genealogy of the profession -- Place and identity -- Being informed about informing -- What's the right thing to do? -- In a democracy -- The information society -- Optimistic synthesis.
  11. M. Lerman (2010). A Framework for Priority Arguments. Cambridge University Press.
    This book presents a unifying framework for using priority arguments to prove theorems in computability.
  12. H. Rogers (1987). Theory of Recursive Functions and Effective Computability. Mit Press.
  13. Keith Devlin (1991). Logic and Information. Cambridge University Press.
    Classical logic, beginning with the work of Aristotle, has developed into a powerful and rigorous mathematical theory with many applications in mathematics and ...
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  14. Amit Hagar (2011). The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction. Morgan & Claypool Publishers.
    In quantum computing, where algorithms exist that can solve computational problems more efficiently than any known classical algorithms, the elimination of errors that result from external disturbances or from imperfect gates has become the ...
  15. Fred Dretske (1981/1999). Knowledge and the Flow of Information. MIT Press.
    This book presents an attempt to develop a theory of knowledge and a philosophy of mind using ideas derived from the mathematical theory of communication developed by Claude Shannon. Information is seen as an objective commodity defined by the dependency relations between distinct events. Knowledge is then analyzed as information caused belief. Perception is the delivery of information in analog form (experience) for conceptual utilization by cognitive mechanisms. The final chapters attempt to develop a theory of meaning (or belief content) (...)
  16. Jan Westerhoff (2011). Reality: A Very Short Introduction. Oxford University Press.
    Is matter real? Are persons real? Is time real? This Very Short Introduction discusses what, if anything, is "real" by looking at a variety of arguments from philosophy, physics, and cognitive science. The book shows that the question "what is real?" is not some esoteric puzzle that only philosophers ponder. Scientists also ask this question when they investigate whether candidates for the fundamental constituents of matter are actually "out there" or just a mere abstraction from a successful theory and cognitive (...)
  17. Aleksandr I͡Akovlevich Khinchin (1957). Mathematical Foundations of Information Theory. New York, Dover Publications.
    Comprehensive, rigorous introduction to work of Shannon, McMillan, Feinstein and Khinchin. Translated by R. A. Silverman and M. D. Friedman.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. Robert Anton Wilson (1990). Quantum Psychology: How Brain Software Programs You and Your World. New Falcon.
  19. Nelson Goodman (1968). Languages of Art. Bobbs-Merrill.
    . . . Unlike Dewey, he has provided detailed incisive argumentation, and has shown just where the dogmas and dualisms break down." -- Richard Rorty, The Yale Review.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. Martin Davis (1958/1982). Computability & Unsolvability. Dover.
    Classic text considersgeneral 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.