Making Presentation Math Computable
Title | Making Presentation Math Computable PDF eBook |
Author | André Greiner-Petter |
Publisher | Springer Nature |
Total Pages | 209 |
Release | 2023-01-24 |
Genre | Technology & Engineering |
ISBN | 3658404736 |
This Open-Access-book addresses the issue of translating mathematical expressions from LaTeX to the syntax of Computer Algebra Systems (CAS). Over the past decades, especially in the domain of Sciences, Technology, Engineering, and Mathematics (STEM), LaTeX has become the de-facto standard to typeset mathematical formulae in publications. Since scientists are generally required to publish their work, LaTeX has become an integral part of today's publishing workflow. On the other hand, modern research increasingly relies on CAS to simplify, manipulate, compute, and visualize mathematics. However, existing LaTeX import functions in CAS are limited to simple arithmetic expressions and are, therefore, insufficient for most use cases. Consequently, the workflow of experimenting and publishing in the Sciences often includes time-consuming and error-prone manual conversions between presentational LaTeX and computational CAS formats. To address the lack of a reliable and comprehensive translation tool between LaTeX and CAS, this thesis makes the following three contributions. First, it provides an approach to semantically enhance LaTeX expressions with sufficient semantic information for translations into CAS syntaxes. Second, it demonstrates the first context-aware LaTeX to CAS translation framework LaCASt. Third, the thesis provides a novel approach to evaluate the performance for LaTeX to CAS translations on large-scaled datasets with an automatic verification of equations in digital mathematical libraries. This is an open access book.
Mathematical Software – ICMS 2020
Title | Mathematical Software – ICMS 2020 PDF eBook |
Author | Anna Maria Bigatti |
Publisher | Springer Nature |
Total Pages | 491 |
Release | 2020-07-07 |
Genre | Computers |
ISBN | 3030522008 |
This book constitutes the proceedings of the 7th International Conference on Mathematical Software, ICMS 2020, held in Braunschweig, Germany, in July 2020. The 48 papers included in this volume were carefully reviewed and selected from 58 submissions. The program of the 2020 meeting consisted of 20 topical sessions, each of which providing an overview of the challenges, achievements and progress in a environment of mathematical software research, development and use.
Computability
Title | Computability PDF eBook |
Author | Douglas S. Bridges |
Publisher | Springer Science & Business Media |
Total Pages | 186 |
Release | 2012-12-06 |
Genre | Mathematics |
ISBN | 1461208637 |
Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.
Computable Structure Theory
Title | Computable Structure Theory PDF eBook |
Author | Antonio Montalbán |
Publisher | Cambridge University Press |
Total Pages | 214 |
Release | 2021-06-24 |
Genre | Mathematics |
ISBN | 1108534422 |
In mathematics, we know there are some concepts - objects, constructions, structures, proofs - that are more complex and difficult to describe than others. Computable structure theory quantifies and studies the complexity of mathematical structures, structures such as graphs, groups, and orderings. Written by a contemporary expert in the subject, this is the first full monograph on computable structure theory in 20 years. Aimed at graduate students and researchers in mathematical logic, it brings new results of the author together with many older results that were previously scattered across the literature and presents them all in a coherent framework, making it easier for the reader to learn the main results and techniques in the area for application in their own research. This volume focuses on countable structures whose complexity can be measured within arithmetic; a forthcoming second volume will study structures beyond arithmetic.
A Mathematical Primer on Computability
Title | A Mathematical Primer on Computability PDF eBook |
Author | Amilcar Sernadas |
Publisher | |
Total Pages | 280 |
Release | 2018-11-07 |
Genre | Computers |
ISBN | 9781848902961 |
The book provides a self-contained introduction to computability theory for advanced undergraduate or early graduate students of mathematics and computer science. The technical material is illustrated with plenty of examples, problems with fully worked solutions as well as a range of proposed exercises. Part I is centered around fundamental computability notions and results, starting with the pillar concepts of computational model (an abstract high-level programming language), computable function, decidable and listable set, proper universal function, decision problem and the reduction technique for transferring decidability and listability properties. The essential results namely Rice's Theorem, Rice-Shapiro's Theorem, Rice-Shapiro-McNaughton-Myhill's Theorem as well as Rogers' Theorem and the Recursion Theorem are presented and illustrated. Many-to-one reducibility and many-to-one degrees are investigated. A short introduction to computation with oracles is also included. Computable as well as non-computable operators are introduced as well as monotonic and finitary operators. The relationship between them is discussed, in particular via Myhill-Shepherdson's Theorem. Kleene's Least Fixed Point Theorem is also presented. Finally, Part I terminates with a briefi ng on the Turing computational model, Turing reducibility and Turing degrees. Part II of the book concentrates on applications of computability in several areas namely in logic (undecidability of arithmetic, satisfiability in propositional logic, decidability in modal logic), Euclidean geometry, graphs and Kolmogorov complexity. Nevertheless no previous knowledge of these subjects is required. The essential details for understanding the applications are provided.
Tools and Algorithms for the Construction and Analysis of Systems
Title | Tools and Algorithms for the Construction and Analysis of Systems PDF eBook |
Author | Dana Fisman |
Publisher | Springer Nature |
Total Pages | 583 |
Release | 2022-03-29 |
Genre | Computers |
ISBN | 3030995240 |
This open access book constitutes the proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022, which was held during April 2-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 46 full papers and 4 short papers presented in this volume were carefully reviewed and selected from 159 submissions. The proceedings also contain 16 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report. TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, exibility, and efficiency of tools and algorithms for building computer-controlled systems.
Mathematics and Computation
Title | Mathematics and Computation PDF eBook |
Author | Avi Wigderson |
Publisher | Princeton University Press |
Total Pages | 434 |
Release | 2019-10-29 |
Genre | Computers |
ISBN | 0691189137 |
An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography