Once Upon an Algorithm

Author: Martin Erwig
Publisher: MIT Press
ISBN: 0262036630
Category : Computers
Languages : en
Pages : 333

Book Description
This easy-to-follow introduction to computer science reveals how familiar stories like Hansel and Gretel, Sherlock Holmes, and Harry Potter illustrate the concepts and everyday relevance of computing. Picture a computer scientist, staring at a screen and clicking away frantically on a keyboard, hacking into a system, or perhaps developing an app. Now delete that picture. In Once Upon an Algorithm, Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study of systematic problem solving. Erwig points out that many daily activities involve problem solving. Getting up in the morning, for example: You get up, take a shower, get dressed, eat breakfast. This simple daily routine solves a recurring problem through a series of well-defined steps. In computer science, such a routine is called an algorithm. Erwig illustrates a series of concepts in computing with examples from daily life and familiar stories. Hansel and Gretel, for example, execute an algorithm to get home from the forest. The movie Groundhog Day illustrates the problem of unsolvability; Sherlock Holmes manipulates data structures when solving a crime; the magic in Harry Potter’s world is understood through types and abstraction; and Indiana Jones demonstrates the complexity of searching. Along the way, Erwig also discusses representations and different ways to organize data; “intractable” problems; language, syntax, and ambiguity; control structures, loops, and the halting problem; different forms of recursion; and rules for finding errors in algorithms. This engaging book explains computation accessibly and shows its relevance to daily life. Something to think about next time we execute the algorithm of getting up in the morning.

Once Upon an Algorithm

Author: Martin Erwig
Publisher: MIT Press
ISBN: 0262545292
Category : Computers
Languages : en
Pages : 333

Once Upon a Time, There Was You

Author: Elizabeth Berg
Publisher: Random House
ISBN: 1588368939
Category : Fiction
Languages : en
Pages : 305

Book Description
BONUS: This edition contains a Once Upon a Time, There Was You discussion guide. Even on their wedding day, John and Irene sensed that they were about to make a mistake. Years later, divorced, dating other people, and living in different parts of the country, they seem to have nothing in common—nothing except the most important person in each of their lives: Sadie, their spirited eighteen-year-old daughter. Feeling smothered by Irene and distanced from John, Sadie is growing more and more attached to her new boyfriend, Ron. When tragedy strikes, Irene and John come together to support the daughter they love so dearly. What takes longer is to remember how they really feel about each other. Elizabeth Berg’s immense talent shines in this unforgettable novel about the power of love, the unshakeable bonds of family, and the beauty of second chances.

The Constitution of Algorithms

Author: Florian Jaton
Publisher: MIT Press
ISBN: 0262542145
Category : Computers
Languages : en
Pages : 401

Book Description
A laboratory study that investigates how algorithms come into existence. Algorithms--often associated with the terms big data, machine learning, or artificial intelligence--underlie the technologies we use every day, and disputes over the consequences, actual or potential, of new algorithms arise regularly. In this book, Florian Jaton offers a new way to study computerized methods, providing an account of where algorithms come from and how they are constituted, investigating the practical activities by which algorithms are progressively assembled rather than what they may suggest or require once they are assembled.

Probably Approximately Correct

Author: Leslie Valiant
Publisher: Basic Books (AZ)
ISBN: 0465032710
Category : Science
Languages : en
Pages : 210

Book Description
Presenting a theory of the theoryless, a computer scientist provides a model of how effective behavior can be learned even in a world as complex as our own, shedding new light on human nature.

Computer Science Distilled

Author: Wladston Ferreira Filho
Publisher: Code Energy
ISBN: 0997316012
Category : Computers
Languages : en
Pages : 188

Book Description
A walkthrough of computer science concepts you must know. Designed for readers who don't care for academic formalities, it's a fast and easy computer science guide. It teaches the foundations you need to program computers effectively. After a simple introduction to discrete math, it presents common algorithms and data structures. It also outlines the principles that make computers and programming languages work.

Algorithms

Author: Panos Louridas
Publisher: MIT Press
ISBN: 0262358670
Category : Computers
Languages : en
Pages : 314

Book Description
In the tradition of Real World Algorithms: A Beginner's Guide, Panos Louridas is back to introduce algorithms in an accessible manner, utilizing various examples to explain not just what algorithms are but how they work. Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently. Application areas range from search engines to tournament scheduling, DNA sequencing, and machine learning. Arguing that every educated person today needs to have some understanding of algorithms and what they do, in this volume in the MIT Press Essential Knowledge series, Panos Louridas offers an introduction to algorithms that is accessible to the nonspecialist reader. Louridas explains not just what algorithms are but also how they work, offering a wide range of examples and keeping mathematics to a minimum.

Computational Fairy Tales

Author: Jeremy Kubica
Publisher: Jeremy Kubica
ISBN:
Category : Computers
Languages : en
Pages : 199

Book Description
"Introduces principles of computational thinking, illustrating high-level computer science concepts, the motivation behind them, and their application in a non-computer fairy tale domain."--Amazon.com.

Real-World Algorithms

Author: Panos Louridas
Publisher: MIT Press
ISBN: 0262035707
Category : Computers
Languages : en
Pages : 527

Book Description
An introduction to algorithms for readers with no background in advanced mathematics or computer science, emphasizing examples and real-world problems. Algorithms are what we do in order not to have to do something. Algorithms consist of instructions to carry out tasks—usually dull, repetitive ones. Starting from simple building blocks, computer algorithms enable machines to recognize and produce speech, translate texts, categorize and summarize documents, describe images, and predict the weather. A task that would take hours can be completed in virtually no time by using a few lines of code in a modern scripting program. This book offers an introduction to algorithms through the real-world problems they solve. The algorithms are presented in pseudocode and can readily be implemented in a computer language. The book presents algorithms simply and accessibly, without overwhelming readers or insulting their intelligence. Readers should be comfortable with mathematical fundamentals and have a basic understanding of how computers work; all other necessary concepts are explained in the text. After presenting background in pseudocode conventions, basic terminology, and data structures, chapters cover compression, cryptography, graphs, searching and sorting, hashing, classification, strings, and chance. Each chapter describes real problems and then presents algorithms to solve them. Examples illustrate the wide range of applications, including shortest paths as a solution to paragraph line breaks, strongest paths in elections systems, hashes for song recognition, voting power Monte Carlo methods, and entropy for machine learning. Real-World Algorithms can be used by students in disciplines from economics to applied sciences. Computer science majors can read it before using a more technical text.

Computational Complexity

Author: Sanjeev Arora
Publisher: Cambridge University Press
ISBN: 0521424267
Category : Computers
Languages : en
Pages : 609

Book Description
New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.