Gør som tusindvis af andre bogelskere
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.Du kan altid afmelde dig igen.
Sir William Rowan Hamilton was a genius, and will be remembered for his significant contributions to physics and mathematics. The Hamiltonian, which is used in quantum physics to describe the total energy of a system, would have been a major achievement for anyone, but Hamilton also invented quaternions, which paved the way for modern vector analysis. Quaternions are one of the most documented inventions in the history of mathematics, and this book is about their invention, and how they are used to rotate vectors about an arbitrary axis. Apart from introducing the reader to the features of quaternions and their associated algebra, the book provides valuable historical facts that bring the subject alive. Quaternions for Computer Graphics introduces the reader to quaternion algebra by describing concepts of sets, groups, fields and rings. It also includes chapters on imaginary quantities, complex numbers and the complex plane, which are essential to understanding quaternions. The book contains many illustrations and worked examples, which make it essential reading for students, academics, researchers and professional practitioners.
"An advanced-level logic textbook that presents proof construction on equal footing with model building. Potentially relevant to students of mathematics and computer science as well"--
Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general.Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages. The book also examines decidable and undecidable problems with emphasis on the case for context-free languages.Topics and features:Provides theorems, examples, and exercises to clarify automata-languages correspondencesPresents some fundamental techniques for parsing both regular and context-free languagesClassifies subclasses of decidable problems, avoiding focus on the theory of complexityExamines finite-automata minimalization and characterization of their behavior using regular expressionsIllustrates how to derive grammars of context-free languages in Chomsky and Greibach normal formsOffers supplementary material on counter machines, stack automata, and abstract language familiesThis highly useful, varied text/reference is suitable for undergraduate and graduate courses on automata theory and formal languages, and assumes no prior exposure to these topics nor any training in mathematics or logic.Alberto Pettorossi is professor of theoretical computer science at the University of Rome Tor Vergata, Rome, Italy.
This CoPart is a dual complement to Visual Category Theory Brick by Brick, Part 2.
The engineering advances started in the second half of the 20th century have created an avalanche of new technology. Control and use of that technology require, among many things, effective computational methods for logic. This book proposes one such method. It makes use of a theory of logic computation based on matroid theory, in particular matroid decomposition. Main features of the theory are an extension of propositional logic, an analysis of logic formulas via combinatorial structures, and a construction of logic solution algorithms based on that analysis. The results have been implemented in a software system for logic programming called the Leibniz System.
The content presented in the book is mainly useful for the students who are preparing for various competitive examinations, campus recruitment training (CRT), MBA entrance tests like GMAT, MAT, CMAT, XAT, etc.
Every mathematician agrees that every mathematician must know some set theory; the disagreement begins in trying to decide how much is some. This book contains my answer to that question. The purpose of the book is to tell the beginning student of advanced mathematics the basic set- theoretic facts of life, and to do so with the minimum of philosophical discourse and logical formalism. The point of view throughout is that of a prospective mathematician anxious to study groups, or integrals, or manifolds. From this point of view the concepts and methods of this book are merely some of the standard mathematical tools; the expert specialist will find nothing new here. Scholarly bibliographical credits and references are out of place in a purely expository book such as this one. The student who gets interested in set theory for its own sake should know, however, that there is much more to the subject than there is in this book. One of the most beautiful sources of set-theoretic wisdom is still Hausdorff's Set theory. A recent and highly readable addition to the literature, with an extensive and up-to-date bibliography, is Axiomatic set theory by Suppes.
From the author of Zero, comes this "admirable salvo against quantitative bamboozlement by the media and the government" (The Boston Globe) In Zero, Charles Seife presented readers with a thrilling account of the strangest number known to humankind. Now he shows readers how the power of skewed metrics-or "proofiness"- is being used to alter perception in both amusing and dangerous ways. Proofiness is behind such bizarre stories as a mathematical formula for the perfect butt and sprinters who can run faster than the speed of sound. But proofiness also has a dark side: bogus mathematical formulas used to undermine our democracy-subverting our justice system, fixing elections, and swaying public opinion with lies. By doing the real math, Seife elegantly and good-humoredly scrutinizes our growing obsession with metrics while exposing those who misuse them.
Recent major advances in model theory include connections between model theory and Diophantine and real analytic geometry, permutation groups, and finite algebras. The present book contains lectures on recent results in algebraic model theory, covering topics from the following areas: geometric model theory, the model theory of analytic structures, permutation groups in model theory, the spectra of countable theories, and the structure of finite algebras. Audience: Graduate students in logic and others wishing to keep abreast of current trends in model theory. The lectures contain sufficient introductory material to be able to grasp the recent results presented.
Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.
Ved tilmelding accepterer du vores persondatapolitik.