The Great Formal Machinery Works


Book Description

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.




An Introduction to Formal Languages and Machine Computation


Book Description

This book provides a concise and modern introduction to Formal Languages and Machine Computation, a group of disparate topics in the theory of computation, which includes formal languages, automata theory, turing machines, computability, complexity, number-theoretic computation, public-key cryptography, and some new models of computation, such as quantum and biological computation. As the theory of computation is a subject based on mathematics, a thorough introduction to a number of relevant mathematical topics, including mathematical logic, set theory, graph theory, modern abstract algebra, and particularly number theory, is given in the first chapter of the book. The book can be used either as a textbook for an undergraduate course, for a first-year graduate course, or as a basic reference in the field.




Formal Methods for Components and Objects


Book Description

Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to more complex systems, resulting from the object-oriented and the more recent component-based software engineering paradigms, requires further development of specification and verification techniques supporting the concepts of reusability and modifiability. This book presents revised tutorial lectures given by invited speakers at the Second International Symposium on Formal Methods for Components and Objects, FMCO 2003, held in Leiden, The Netherlands, in November 2003. The 17 revised lectures by leading researchers present a comprehensive account of the potential of formal methods applied to large and complex software systems such as component-based systems and object systems. The book makes a unique contribution to bridging the gap between theory and practice in software engineering.




Industrial Use of Formal Methods


Book Description

At present the literature gives students and researchers of the very general books on the formal technics. The purpose of this book is to present in a single book, a return of experience on the used of the “formal technics” (such proof and model-checking) on industrial examples for the transportation domain. This book is based on the experience of people which are completely involved in the realization and the evaluation of safety critical system software based. The implication of the industrialists allows to raise the problems of confidentiality which could appear and so allow to supply new useful information (photos, plan of architecture, real example).







Introduction to Formal Languages, Automata Theory and Computation


Book Description

Introduction to Formal Languages, Automata Theory and Computation presents the theoretical concepts in a concise and clear manner, with an in-depth coverage of formal grammar and basic automata types. The book also examines the underlying theory and principles of computation and is highly suitable to the undergraduate courses in computer science and information technology. An overview of the recent trends in the field and applications are introduced at the appropriate places to stimulate the interest of active learners.




The Best Writing on Mathematics 2019


Book Description

The year's finest mathematical writing from around the world This annual anthology brings together the year's finest mathematics writing from around the world. Featuring promising new voices alongside some of the foremost names in the field, The Best Writing on Mathematics 2019 makes available to a wide audience many articles not easily found anywhere else—and you don't need to be a mathematician to enjoy them. These essays delve into the history, philosophy, teaching, and everyday aspects of math, offering surprising insights into its nature, meaning, and practice—and taking readers behind the scenes of today's hottest mathematical debates. In this volume, Moon Duchin explains how geometric-statistical methods can be used to combat gerrymandering, Jeremy Avigad illustrates the growing use of computation in making and verifying mathematical hypotheses, and Kokichi Sugihara describes how to construct geometrical objects with unusual visual properties. In other essays, Neil Sloane presents some recent additions to the vast database of integer sequences he has catalogued, and Alessandro Di Bucchianico and his colleagues highlight how mathematical methods have been successfully applied to big-data problems. And there's much, much more. In addition to presenting the year's most memorable math writing, this must-have anthology includes an introduction by the editor and a bibliography of other notable writings on mathematics. This is a must-read for anyone interested in where math has taken us—and where it is headed.




Theories of Programming and Formal Methods


Book Description

This Festschrift volume, dedicated to Jifeng He on the occasion of his 80th birthday, includes refereed papers by leading researchers, many of them current and former colleagues, presented at a dedicated celebration in the Shanghai Science Hall in September 2023. Jifeng was an important researcher on the European ESPRIT ProCoS project and the Working Group on Provably Correct Systems, subsequently he collaborated with Tony Hoare on Unifying Theories of Programming. Jifeng returned to China in 1998, first to the United Nations University in Macau and then to the East China Normal University in Shanghai. He has since founded an Artificial Intelligence research institute that focuses on the application of technology in large-scale industrial software systems. His scientific contributions have been recognized through his election to membership of the Chinese Academy of Sciences. The first paper in the volume provides an overview of Jifeng’s research contributions, especially in the area of formal methods, and the following two papers detail developments in UTP and rCOS (refinement calculus of object systems). In the next two sections of the book, the editors included papers by colleagues and coauthors of Jifeng while he was at the University of Oxford and engaged with the European ProCoS project. The section that follows includes papers authored by colleagues from his later research in China and Europe. The final section includes a paper related to Jifeng’s recent roadmap for UTP.




Bloomsbury Semiotics Volume 2: Semiotics in the Natural and Technical Sciences


Book Description

Bloomsbury Semiotics offers a state-of-the-art overview of the entire field of semiotics by revealing its influence on a wide range of disciplinary perspectives. With four volumes spanning theory, method and practice across the disciplines, this definitive reference work emphasizes and strengthens common bonds shared across intellectual cultures, and facilitates the discovery and recovery of meaning across fields. It comprises: Volume 1: History and Semiosis Volume 2: Semiotics in the Natural and Technical Sciences Volume 3: Semiotics in the Arts and Social Sciences Volume 4: Semiotic Movements Written by leading international experts, the chapters provide comprehensive overviews of the history and status of semiotic inquiry across a diverse range of traditions and disciplines. Together, they highlight key contemporary developments and debates along with ongoing research priorities. Providing the most comprehensive and united overview of the field, Bloomsbury Semiotics enables anyone, from students to seasoned practitioners, to better understand and benefit from semiotic insight and how it relates to their own area of study or research. Volume 2: Semiotics in the Natural and Technical Sciences presents the state-of-the art in semiotic approaches to disciplines ranging from mathematics and biology to neuroscience and medicine, from evolutionary linguistics and animal behaviour studies to computing, finance, law, architecture, and design. Each chapter casts a vision for future research priorities, unanswered questions, and fresh openings for semiotic participation in these and related fields.




Language and the Rise of the Algorithm


Book Description

A wide-ranging history of the intellectual developments that produced the modern idea of the algorithm. Bringing together the histories of mathematics, computer science, and linguistic thought, Language and the Rise of the Algorithm reveals how recent developments in artificial intelligence are reopening an issue that troubled mathematicians long before the computer age. How do you draw the line between computational rules and the complexities of making systems comprehensible to people? Here Jeffrey M. Binder offers a compelling tour of four visions of universal computation that addressed this issue in very different ways: G. W. Leibniz's calculus ratiocinator; a universal algebra scheme Nicolas de Condorcet designed during the French Revolution; George Boole's nineteenth-century logic system; and the early programming language ALGOL, whose name is short for algorithmic language. These episodes show that symbolic computation has repeatedly become entangled in debates about the nature of communication. To what extent can meaning be controlled by individuals, like the values of a and b in algebra, and to what extent is meaning inevitably social? By attending to this long-neglected question, we come to see that the modern idea of the algorithm is implicated in a long history of attempts to maintain a disciplinary boundary separating technical knowledge from the languages people speak day to day. Machine learning, in its increasing dependence on words, now places this boundary in jeopardy, making its stakes all the more urgent to understand. The idea of the algorithm is a levee holding back the social complexity of language, and it is about to break. This book is about the flood that inspired its construction.