Book picks similar to
Logic for Computer Science: Foundations of Automatic Theorem Proving (Dover Books on Computer Science) by Jean H. Gallier
computer-science
math-logic
cs-logic
math
Abstract Algebra
I.N. Herstein - 1986
Providing a concise introduction to abstract algebra, this work unfolds some of the fundamental systems with the aim of reaching applicable, significant results.
Fuzzy Thinking: The New Science of Fuzzy Logic
Bart Kosko - 1993
An authoritative introduction to "fuzzy logic" brings readers up to speed on the "smart" products and computers that will change all of our lives in the future.
Pattern Classification
David G. Stork - 1973
Now with the second edition, readers will find information on key new topics such as neural networks and statistical pattern recognition, the theory of machine learning, and the theory of invariances. Also included are worked examples, comparisons between different methods, extensive graphics, expanded exercises and computer project topics.An Instructor's Manual presenting detailed solutions to all the problems in the book is available from the Wiley editorial department.
Fundamentals of Logic Design
Charles H. Roth Jr. - 1975
Author Charles H. Roth, Jr. carefully presents the theory that is necessary for understanding the fundamental concepts of logic design while not overwhelming students with the mathematics of switching theory. Divided into 20 easy-to-grasp study units, the book covers such fundamental concepts as Boolean algebra, logic gates design, flip-flops, and state machines. By combining flip-flops with networks of logic gates, students will learn to design counters, adders, sequence detectors, and simple digital systems. After covering the basics, this text presents modern design techniques using programmable logic devices and the VHDL hardware description language.
Data Analysis with Open Source Tools: A Hands-On Guide for Programmers and Data Scientists
Philipp K. Janert - 2010
With this insightful book, intermediate to experienced programmers interested in data analysis will learn techniques for working with data in a business environment. You'll learn how to look at data to discover what it contains, how to capture those ideas in conceptual models, and then feed your understanding back into the organization through business plans, metrics dashboards, and other applications.Along the way, you'll experiment with concepts through hands-on workshops at the end of each chapter. Above all, you'll learn how to think about the results you want to achieve -- rather than rely on tools to think for you.Use graphics to describe data with one, two, or dozens of variablesDevelop conceptual models using back-of-the-envelope calculations, as well asscaling and probability argumentsMine data with computationally intensive methods such as simulation and clusteringMake your conclusions understandable through reports, dashboards, and other metrics programsUnderstand financial calculations, including the time-value of moneyUse dimensionality reduction techniques or predictive analytics to conquer challenging data analysis situationsBecome familiar with different open source programming environments for data analysisFinally, a concise reference for understanding how to conquer piles of data.--Austin King, Senior Web Developer, MozillaAn indispensable text for aspiring data scientists.--Michael E. Driscoll, CEO/Founder, Dataspora
Fundamentals of Deep Learning: Designing Next-Generation Artificial Intelligence Algorithms
Nikhil Buduma - 2015
Topology
James R. Munkres - 1975
Includes many examples and figures. GENERAL TOPOLOGY. Set Theory and Logic. Topological Spaces and Continuous Functions. Connectedness and Compactness. Countability and Separation Axioms. The Tychonoff Theorem. Metrization Theorems and paracompactness. Complete Metric Spaces and Function Spaces. Baire Spaces and Dimension Theory. ALGEBRAIC TOPOLOGY. The Fundamental Group. Separation Theorems. The Seifert-van Kampen Theorem. Classification of Surfaces. Classification of Covering Spaces. Applications to Group Theory. For anyone needing a basic, thorough, introduction to general and algebraic topology and its applications.
Reinforcement Learning: An Introduction
Richard S. Sutton - 1998
Their discussion ranges from the history of the field's intellectual foundations to the most recent developments and applications.Reinforcement learning, one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives when interacting with a complex, uncertain environment. In Reinforcement Learning, Richard Sutton and Andrew Barto provide a clear and simple account of the key ideas and algorithms of reinforcement learning. Their discussion ranges from the history of the field's intellectual foundations to the most recent developments and applications. The only necessary mathematical background is familiarity with elementary concepts of probability.The book is divided into three parts. Part I defines the reinforcement learning problem in terms of Markov decision processes. Part II provides basic solution methods: dynamic programming, Monte Carlo methods, and temporal-difference learning. Part III presents a unified view of the solution methods and incorporates artificial neural networks, eligibility traces, and planning; the two final chapters present case studies and consider the future of reinforcement learning.
The Classroom Chef: Sharpen Your Lessons, Season Your Classes, Make Math Meaninful
John Stevens - 2016
You can use these ideas and methods as-is, or better yet, tweak them and create your own enticing educational meals. The message the authors share is that, with imagination and preparation, every teacher can be a Classroom Chef.
How to Bake Pi: An Edible Exploration of the Mathematics of Mathematics
Eugenia Cheng - 2015
Of course, it’s not all cooking; we’ll also run the New York and Chicago marathons, pay visits to Cinderella and Lewis Carroll, and even get to the bottom of a tomato’s identity as a vegetable. This is not the math of our high school classes: mathematics, Cheng shows us, is less about numbers and formulas and more about how we know, believe, and understand anything, including whether our brother took too much cake.At the heart of How to Bake Pi is Cheng’s work on category theory—a cutting-edge “mathematics of mathematics.” Cheng combines her theory work with her enthusiasm for cooking both to shed new light on the fundamentals of mathematics and to give readers a tour of a vast territory no popular book on math has explored before. Lively, funny, and clear, How to Bake Pi will dazzle the initiated while amusing and enlightening even the most hardened math-phobe.
Calculus
Michael Spivak - 1967
His aim is to present calculus as the first real encounter with mathematics: it is the place to learn how logical reasoning combined with fundamental concepts can be developed into a rigorous mathematical theory rather than a bunch of tools and techniques learned by rote. Since analysis is a subject students traditionally find difficult to grasp, Spivak provides leisurely explanations, a profusion of examples, a wide range of exercises and plenty of illustrations in an easy-going approach that enlightens difficult concepts and rewards effort. Calculus will continue to be regarded as a modern classic, ideal for honours students and mathematics majors, who seek an alternative to doorstop textbooks on calculus, and the more formidable introductions to real analysis.
The Intelligent Web: Search, Smart Algorithms, and Big Data
Gautam Shroff - 2013
These days, linger over a Web page selling lamps, and they will turn up at the advertising margins as you move around the Internet, reminding you, tempting you to make that purchase. Search engines such as Google can now look deep into the data on the Web to pull out instances of the words you are looking for. And there are pages that collect and assess information to give you a snapshot of changing political opinion. These are just basic examples of the growth of Web intelligence, as increasingly sophisticated algorithms operate on the vast and growing amount of data on the Web, sifting, selecting, comparing, aggregating, correcting; following simple but powerful rules to decide what matters. While original optimism for Artificial Intelligence declined, this new kind of machine intelligence is emerging as the Web grows ever larger and more interconnected.Gautam Shroff takes us on a journey through the computer science of search, natural language, text mining, machine learning, swarm computing, and semantic reasoning, from Watson to self-driving cars. This machine intelligence may even mimic at a basic level what happens in the brain.
Introductory Circuit Analysis
Robert L. Boylestad - 1968
Features exceptionally clear explanations and descriptions, step-by-step examples, more than 50 practical applications, over 2000 easy-to-challenging practice problems, and comprehensive coverage of essentials. PSpice, OrCAd version 9.2 Lite Edition, Multisims 2001 version of Electronics Workbench, and MathCad software references and examples are used throughout. Computer programs (C++, BASIC and PSpice) are printed in color, as they run, at the point in the book where they are discussed. Current and Voltage. Resistance. Ohm's Law, Power, and Energy. Series Circuits. Parallel Circuits. Series-Parallel Networks. Methods of Analysis & Selected Topics. Network Theorems. Capacitors. Magnetic Circuits. Inductors. Sinusodial Alternating Waveforms. The Basic Elements and Phasors. Series and Parallel ac Circuits. Series-Parallel ac Networks. Methods of Analysis and Related Topics. Network Theorems (ac). Power (ac). Resonance. Transformers. Polyphase Systems. Decibels, Filters, and Bode Points. Pulse Waveforms and the R-C Response. Nonsinusodial Circuits. System Analysis: An Introduction. For those working in electronic technology.
On Numbers and Games
John H. Conway - 1976
Originally written to define the relation between the theories of transfinite numbers and mathematical games, the resulting work is a mathematically sophisticated but eminently enjoyable guide to game theory. By defining numbers as the strengths of positions in certain games, the author arrives at a new class, the surreal numbers, that includes both real numbers and ordinal numbers. These surreal numbers are applied in the author's mathematical analysis of game strategies. The additions to the Second Edition present recent developments in the area of mathematical game theory, with a concentration on surreal numbers and the additive theory of partizan games.
Calculus: Early Transcendental Functions
Ron Larson - 1900
Two primary objectives guided the authors in the revision of this book: to develop precise, readable materials for students that clearly define and demonstrate concepts and rules of calculus; and to design comprehensive teaching resources for instructors that employ proven pedagogical techniques and save time. The Larson/Hostetler/Edwards Calculus program offers a solution to address the needs of any calculus course and any level of calculus student. Every edition from the first to the fourth of Calculus: Early Transcendental Functions, 4/e has made the mastery of traditional calculus skills a priority, while embracing the best features of new technology and, when appropriate, calculus reform ideas. Now, the Fourth Edition is part of the first calculus program to offer algorithmic homework and testing created in Maple so that answers can be evaluated with complete mathematical accuracy.