Theory And Practice Of Computation - Proceedings Of Workshop On Computation: Theory And Practice Wctp2016, Nishizaki Shin-ya, Caro Jaime D L, Suarez Merlin Teodosia C, Numao Masayuki
Автор: Barendregt Название: Lambda Calculus with Types ISBN: 0521766141 ISBN-13(EAN): 9780521766142 Издательство: Cambridge Academ Рейтинг: Цена: 12830.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Typed lambda calculus is used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), which are used to design and verify IT products and mathematical proofs. This book reveals unexpected mathematical beauty in three classes of typing: simple types, recursive types and intersection types. Numerous exercises are provided.
The information age owes its existence to a little-known but crucial development, the theoretical study of logic and the foundations of mathematics. The Great Formal Machinery Works draws on original sources and rare archival materials to trace the history of the theories of deduction and computation that laid the logical foundations for the digital revolution.
Jan von Plato examines the contributions of figures such as Aristotle; the nineteenth-century German polymath Hermann Grassmann; George Boole, whose Boolean logic would prove essential to programming languages and computing; Ernst Schr der, best known for his work on algebraic logic; and Giuseppe Peano, cofounder of mathematical logic. Von Plato shows how the idea of a formal proof in mathematics emerged gradually in the second half of the nineteenth century, hand in hand with the notion of a formal process of computation. A turning point was reached by 1930, when Kurt G del conceived his celebrated incompleteness theorems. They were an enormous boost to the study of formal languages and computability, which were brought to perfection by the end of the 1930s with precise theories of formal languages and formal deduction and parallel theories of algorithmic computability. Von Plato describes how the first theoretical ideas of a computer soon emerged in the work of Alan Turing in 1936 and John von Neumann some years later.
Shedding new light on this crucial chapter in the history of science, The Great Formal Machinery Works is essential reading for students and researchers in logic, mathematics, and computer science.
What Can Be Computed? is a uniquely accessible yet rigorous introduction to the most profound ideas at the heart of computer science. Crafted specifically for undergraduates who are studying the subject for the first time, and requiring minimal prerequisites, the book focuses on the essential fundamentals of computer science theory and features a practical approach that uses real computer programs (Python and Java) and encourages active experimentation. It is also ideal for self-study and reference.
The book covers the standard topics in the theory of computation, including Turing machines and finite automata, universal computation, nondeterminism, Turing and Karp reductions, undecidability, time-complexity classes such as P and NP, and NP-completeness, including the Cook-Levin Theorem. But the book also provides a broader view of computer science and its historical development, with discussions of Turing's original 1936 computing machines, the connections between undecidability and Godel's incompleteness theorem, and Karp's famous set of twenty-one NP-complete problems.
Throughout, the book recasts traditional computer science concepts by considering how computer programs are used to solve real problems. Standard theorems are stated and proven with full mathematical rigor, but motivation and understanding are enhanced by considering concrete implementations. The book's examples and other content allow readers to view demonstrations of--and experiment with--a wide selection of the topics it covers. The result is an ideal text for an introduction to the theory of computation.
An accessible and rigorous introduction to the essential fundamentals of computer science theory, written specifically for undergraduates taking introduction to the theory of computation
Features a practical, interactive approach using real computer programs (Python in the text, with Java alternatives online) to enhance motivation and understanding
Gives equal emphasis to computability and complexity
Includes special topics that demonstrate the profound nature of key ideas in the theory of computation
Features a companion website that includes additional materials
Автор: Hinman Название: Recursion-Theoretic Hierarchies ISBN: 1107168244 ISBN-13(EAN): 9781107168244 Издательство: Cambridge Academ Рейтинг: Цена: 23918.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The theory set out in this volume is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. The author develops a general theory from which the results of both areas can be derived, making the common themes clear.
Автор: Watrous, John (university Of Waterloo, Ontario) Название: The theory of quantum information ISBN: 1107180562 ISBN-13(EAN): 9781107180567 Издательство: Cambridge Academ Рейтинг: Цена: 11563.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Intended for graduate students and researchers, this book presents a formal development of the mathematical theory of quantum information. Largely self-contained, with clear proofs and a wide range of exercises, it will help the reader grasp the fundamental facts and techniques that form the mathematical foundations of the subject.
Автор: J.-J. Ch. Meyer, W. van der Hoek Название: Epistemic Logic for AI and Computer Science ISBN: 0521602807 ISBN-13(EAN): 9780521602808 Издательство: Cambridge Academ Рейтинг: Цена: 9186.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, based on courses taught at universities and summer schools, provides a broad introduction to the subject; many exercises are included with their solutions.
Автор: M‚zard, Marc; Montanari, Andrea Название: Information, Physics, and Computation ISBN: 019857083X ISBN-13(EAN): 9780198570837 Издательство: Oxford Academ Рейтинг: Цена: 14731.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A very active field of research is emerging at the frontier of statistical physics, theoretical computer science/discrete mathematics, and coding/information theory. This book sets up a common language and pool of concepts, accessible to students and researchers from each of these fields.
Описание: The conference consissted of three parts: - Advanced Seminar on Foundations of Innovative Software Development - Colloquium on Trees in Algebra and Programming (CAAP `89) - Colloquium on Current Issues in Programming Languages (CCIPL) The TAPSOFT `89 Conference Proceedings are published in two volumes.
Автор: Jackson, Howard Название: Words and their meaning ISBN: 1138413917 ISBN-13(EAN): 9781138413917 Издательство: Taylor&Francis Рейтинг: Цена: 29858.00 р. Наличие на складе: Поставка под заказ.
Описание: An examination of the rise of the English dictionary, the kinds of dictionary available, the range of information they contain, factors affecting their usage and public attitudes towards them. The advantages of a thesaurus-like approach over the traditional format are discussed.
Автор: Li, Fanzhang / Zhang, Li / Zhang, Zhao Название: Dynamic Fuzzy Machine Learning ISBN: 3110518708 ISBN-13(EAN): 9783110518702 Издательство: Walter de Gruyter Рейтинг: Цена: 22439.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Machine learning is widely used for data analysis. Dynamic fuzzy data are one of the most difficult types of data to analyse in the field of big data, cloud computing, the Internet of Things, and quantum information. At present, the processing of this kind of data is not very mature. The authors carried out more than 20 years of research, and show in this book their most important results. The seven chapters of the book are devoted to key topics such as dynamic fuzzy machine learning models, dynamic fuzzy self-learning subspace algorithms, fuzzy decision tree learning, dynamic concepts based on dynamic fuzzy sets, semi-supervised multi-task learning based on dynamic fuzzy data, dynamic fuzzy hierarchy learning, examination of multi-agent learning model based on dynamic fuzzy logic. This book can be used as a reference book for senior college students and graduate students as well as college teachers and scientific and technical personnel involved in computer science, artificial intelligence, machine learning, automation, data analysis, mathematics, management, cognitive science, and finance. It can be also used as the basis for teaching the principles of dynamic fuzzy learning.
Автор: Cockshott, Paul; Mackenzie, Lewis M.; Michaelson, Название: Computation and its Limits ISBN: 019872912X ISBN-13(EAN): 9780198729129 Издательство: Oxford Academ Рейтинг: Цена: 5622.00 р. Наличие на складе: Поставка под заказ.
Описание: Although we are entirely unaware of it, computation is central to all aspects of our existences. Every day we solve, or try to solve, a myriad of problems, from the utterly trivial to the bafflingly complex. This book explains why it is possible to do computation and what the ultimate limits of it are, as understood by modern science.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
