Learn You a Haskell for Great Good! introduces programmers familiar with imperative languages (such as C++, Java, or Python) to the unique aspects of functional programming. Packed with jokes, pop culture references, and the author's own hilarious artwork, Learn You a Haskell for Great Good! eases the learning curve of this complex language, and is a perfect starting point for any programmer looking to expand his or her horizons. The well-known web tutorial on which this book is based is widely regarded as the best way for beginners to learn Haskell, and receives over 30,000 unique visitors monthly.

    And through CODE, we see how this ingenuity and our very human compulsion to communicate have driven the technological innovations of the past two centuries. Using everyday objects and familiar language systems such as Braille and Morse code, author Charles Petzold weaves an illuminating narrative for anyone who’s ever wondered about the secret inner life of computers and other smart machines. It’s a cleverly illustrated and eminently comprehensible story—and along the way, you’ll discover you’ve gained a real context for understanding today’s world of PCs, digital media, and the Internet. No matter what your level of technical savvy, CODE will charm you—and perhaps even awaken the technophile within.

    Now, at a moment when mathematicians are finally moving in on a proof, Dartmouth professor Dan Rockmore tells the riveting history of the hunt for a solution.In 1859 German professor Bernhard Riemann postulated a law capable of describing with an amazing degree of accuracy the occurrence of the prime numbers. Rockmore takes us all the way from Euclid to the mysteries of quantum chaos to show how the Riemann hypothesis lies at the very heart of some of the most cutting-edge research going on today in physics and mathematics.

    It gives clear descriptions of linear systems and uses mathematics not only to prove axiomatic theory, but also to enhance physical and intuitive understanding.

    Features: - Same great Essential Elements 2000 method - 15-minute video/"super lesson" for learning the basics- Play-along mp3* tracks for all 185 exercises (featuring a professional player on your instrument)- Tempo Adjustment Software- Duets and Trios- Music Listening Library- SmartMusic Software for Exercises 1-100 (for use on PC/Mac) - practice, record, and email a performance with on-screen assessment *mp3 files will play on most current CD or DVD players Authors: Tim Lautzenheiser, John Higgins, Charles Menghini, Paul Lavender, Tom C. Rhodes, Don Bierschenk

    The text begins with a discussion of the real number system as a complete ordered field. (Dedekind's construction is now treated in an appendix to Chapter I.) The topological background needed for the development of convergence, continuity, differentiation and integration is provided in Chapter 2. There is a new section on the gamma function, and many new and interesting exercises are included. This text is part of the Walter Rudin Student Series in Advanced Mathematics.

    The study of type systems--and of programming languages from a type-theoretic perspective--has important applications in software engineering, language design, high-performance compilers, and security.This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material.The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.

    It offers Web exercises for every chapter, password protected instructor support material and syllabus manager.

    In the four main sections of the book, Stein tells the stories of the mathematical thinkers who discerned some of the most fundamental aspects of our universe. From their successes and failures, delusions, and even duels, the trajectories of their innovations—and their impact on society—are traced in this fascinating narrative. Quantum mechanics, space-time, chaos theory and the workings of complex systems, and the impossibility of a "perfect" democracy are all here. Stein's book is both mind-bending and practical, as he explains the best way for a salesman to plan a trip, examines why any thought you could have is imbedded in the number π , and—perhaps most importantly—answers one of the modern world's toughest questions: why the garage can never get your car repaired on time.Friendly, entertaining, and fun, How Math Explains the World is the first book by one of California's most popular math teachers, a veteran of both "math for poets" and Princeton's Institute for Advanced Studies. And it's perfect for any reader wanting to know how math makes both science and the world tick.

    The author has sought to utlilize the technology now available for the teaching and learning of calculus. The hand-held graphics calculator is one such form of technology that has been integrated into the book. Topics in algebra, trigonometry, and analytical geometry appear in the Appendix.

    It also lists all of his books, including those about other characters, in order of publication date. Why the made-for-kindle reading list : Just a problem-solving tool so we don't have to have a printed list from the author's website lying around or navigate the tiny browser on our kindles to find which book was next in the series. The book # is usually cut off from the titles when browsing the store from the kindle. This is a title list only. In reading order. No portions of the books mentioned have been reproduced here. No copyright infringement is intended. Just to avoid any misunderstandings about copyright, according to the United States Copyright Office, “Copyright law does not protect names, titles, or short phrases or expressions.” (copyright.gov, circular 34). I hope you find this made-for-kindle list as helpful as I do in deciding which of Mr. Connelly's books to purchase and enjoy next.

     -Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. -Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. -Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http: //msp.org

    By following the recommendations of the Association of Computing Machinery's Java Task Force, this first edition text adopts a modern objects-first approach that introduces readers to useful hierarchies from the very beginning.KEY TOPICS: Introduction; Programming by Example; Expressions; Statement Forms; Methods; Objects and Classes; Objects and Memory; Strings and Characters; Object-Oriented Graphics; Event-Driven Programs; Arrays and ArrayLists; Searching and Sorting; Collection Classes; Looking Ahead.MARKET: A modern objects-first approach to the Java programming language that introduces readers to useful class hierarchies from the very beginning.

    The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. If you want to take a hard pass on Knuth's brilliant but impenetrable theories and the dense multi-page proofs you'll find in most textbooks, this is the book for you. This fully-illustrated and engaging guide makes it easy for you to learn how to use algorithms effectively in your own programs.Grokking Algorithms is a disarming take on a core computer science topic. In it, you'll learn how to apply common algorithms to the practical problems you face in day-to-day life as a programmer. You'll start with problems like sorting and searching. As you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression or artificial intelligence. Whether you're writing business software, video games, mobile apps, or system utilities, you'll learn algorithmic techniques for solving problems that you thought were out of your grasp. For example, you'll be able to:Write a spell checker using graph algorithmsUnderstand how data compression works using Huffman codingIdentify problems that take too long to solve with naive algorithms, and attack them with algorithms that give you an approximate answer insteadEach carefully-presented example includes helpful diagrams and fully-annotated code samples in Python. By the end of this book, you will know some of the most widely applicable algorithms as well as how and when to use them.

    They can navigate more data than a doctor or lawyer and act with greater precision. For many years we’ve taken solace in the notion that they can’t create. But now that algorithms can learn and adapt, does the future of creativity belong to machines, too?It is hard to imagine a better guide to the bewildering world of artificial intelligence than Marcus du Sautoy, a celebrated Oxford mathematician whose work on symmetry in the ninth dimension has taken him to the vertiginous edge of mathematical understanding. In The Creativity Code he considers what machine learning means for the future of creativity. The Pollockizer can produce drip paintings in the style of Jackson Pollock, Botnik spins off fanciful (if improbable) scenes inspired by J. K. Rowling, and the music-composing algorithm Emmy managed to fool a panel of Bach experts. But do these programs just mimic, or do they have what it takes to create? Du Sautoy argues that to answer this question, we need to understand how the algorithms that drive them work―and this brings him back to his own subject of mathematics, with its puzzles, constraints, and enticing possibilities.While most recent books on AI focus on the future of work, The Creativity Code moves us to the forefront of creative new technologies and offers a more positive and unexpected vision of our future cohabitation with machines. It challenges us to reconsider what it means to be human―and to crack the creativity code.