Program Verification in the presence of complex numbers, functions with branch cuts etc

In considering the reliability of numerical programs, it is normal to "limit our study to the semantics dealing with numerical precision" (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that essentially ignores the numerics. The thesis of this paper is that there is a class of problems that fall between these two, which could be described as "does the low-level arithmetic implement the high-level mathematics". Many of these problems arise because mathematics, particularly the mathematics of the complex numbers, is more difficult than expected: for example the complex function log is not continuous, writing down a program to compute an inverse function is more complicated than just solving an equation, and many algebraic simplification rules are not universally valid. The good news is that these problems are theoretically capable of being solved, and are practically close to being solved, but not yet solved, in several real-world examples. However, there is still a long way to go before implementations match the theoretical possibilities

Techniques for the Synthesis of Reversible Toffoli Networks

This paper presents novel techniques for the synthesis of reversible networks of Toffoli gates, as well as improvements to previous methods. Gate count and technology oriented cost metrics are used. Our synthesis techniques are independent of the cost metrics. Two new iterative synthesis procedure employing Reed-Muller spectra are introduced and shown to complement earlier synthesis approaches. The template simplification suggested in earlier work is enhanced through introduction of a faster and more efficient template application algorithm, updated (shorter) classification of the templates, and presentation of the new templates of sizes 7 and 9. A novel ``resynthesis'' approach is introduced wherein a sequence of gates is chosen from a network, and the reversible specification it realizes is resynthesized as an independent problem in hopes of reducing the network cost. Empirical results are presented to show that the methods are effective both in terms of the realization of all 3x3 reversible functions and larger reversible benchmark specifications.Comment: 20 pages, 5 figure

Practical simplification of elementary functions using CAD

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Academic program of study guide

Orangeburg‐Calhoun Technical Collegeʹs Early College allows ambitious high school students in Orangeburg and Calhoun counties the opportunity to earn college credits before they graduate. This Program of Study Guide provides information to assist students and their parents in selecting the most rigorous and appropriate coursework, as well as the most appropriate available Early College model for participation. Course descriptions are included for your convenience and indicate how the courses fit into both high school diploma and college certificate or degree completion

Estruturas lógico-quânticas para partículas semelhantes

In this work we discuss logical structures related to indistinguishable (or similar) particles. Most of the framework used to develop these structures was presented in previous works. We use these structures and constructions to discuss possible ontologies for identical particles. In other words, we use these structures in order to characterize the logical structure of quantum systems for the case of similar particles, and draw possible philosophical implications. We also review some proposals available in the literature which may be considered within the framework of the quantum logical tradition regarding the problem of indistinguishability. Besides these discussions and constructions, we advance novel technical results, namely, a latticetheoretical structure for identical particles for the finite dimensional case. This approach has not been present in the scarce literature on quantum logic and similar particles.Neste trabalho discutimos estruturas lógicas relacionadas a partículas indistinguíveis (ou semelhantes). A maior parte do quadro teórico usado para desenvolver essas estruturas foi apresentada em trabalhos anteriores. Usamos essas estruturas e construções para discutir possíveis ontologias para partículas idênticas. Em outras palavras, usamos essas estruturas para caracterizar a estrutura lógica de sistemas quânticos para o caso de partículas semelhantes, e traçamos possíveis implicações filosóficas. Também examinamos algumas propostas disponíveis na literatura que podem ser consideradas dentro do quadro da tradição da lógica quântica concernentes ao problema da indistinguibilidade. Além dessas discussões e construções, apresentamos novos resultados técnicos relativos à estrutura da teoria de reticulado para partículas idênticas, no caso de dimensão finita. Esta abordagem não está presente na pequena literatura sobre lógica quântica e partículas semelhantes.Fil: Holik, Federico Hernán. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Física La Plata. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Física La Plata; ArgentinaFil: Gomez, Ignacio Sebastián. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Instituto de Física de Rosario. Universidad Nacional de Rosario. Instituto de Física de Rosario; ArgentinaFil: Krause, Décio. Universidade Federal de Santa Catarina; Brasi

Robustness and Randomness

Robustness problems of computational geometry algorithms is a topic that has been subject to intensive research efforts from both computer science and mathematics communities. Robustness problems are caused by the lack of precision in computations involving floating-point instead of real numbers. This paper reviews methods dealing with robustness and inaccuracy problems. It discussed approaches based on exact arithmetic, interval arithmetic and probabilistic methods. The paper investigates the possibility to use randomness at certain levels of reasoning to make geometric constructions more robust