Results 201 to 210 of about 480,148 (242)
Some of the next articles are maybe not open access.

Mathematical Theory of Computation

1991
Abstract : This project was concerned with the development of correct and reusable software through the use of higher order abstractions (function, control, assignment, process) and reflection. A semantic framework for these notions will be the basis of an experimental system for manipulating and reasoning about programs. The goals of this project were
openaire   +1 more source

A mathematical theory for the spread of computer viruses

Computers & Security, 1989
A model is introduced to treat the spread of computer viruses mathematically. A recurrence formula is given which allows a closed expression to be derived for the probability that, starting from an initial state, a given viral state will be reached after executing exactly k programs. In some special cases this recurrence formula can be used for numeric
openaire   +2 more sources

Development of Mathematical Theory in Computer Vision

2014
This chapter presents a brief description of chapters devoted to the theoretical development of computer vision. Original investigations in mathematical morphology, estimations of structural changes, the hierarchical adaptive Karhunen-Loeve and projective transforms, among others, provide the great contribution in mathematical foundations of computer ...
Margarita N. Favorskaya, Lakhmi C. Jain
openaire   +2 more sources

Mathematical Theory of Serial Computers

1976
About 20 years ago (see e.g. [1]) the automation of programming started. Its aim was to facilitate the programming activity, and the direct reason was the “difficulty” of learning and using machine codes.
openaire   +2 more sources

Second-order mathematical theory of computation

Proceedings of the second annual ACM symposium on Theory of computing - STOC '70, 1970
In this work we show that it is possible to formalize all properties regularly observed in (deterministic and non-deterministic) algorithms in second-order predicate calculus. Moreover, we show that for any given algorithm it suffices to know how to formalize its 'partial correctness' by a second-order formula in order to formalize all other properties
openaire   +2 more sources

Lectures on a Mathematical Theory of Computation

1982
These notes were originally written for lectures on the semantics of programming languages delivered at Oxford during Michaelmas Term 1980. The purpose of the course was to provide the foundations needed for the method of denotational semantics; in particular I wanted to make the connections with recursive function theory more definite and to show how ...
openaire   +2 more sources

Logic, Foundations of Mathematics, and Computability Theory

1977
I. Formal Development of the Theory of Quantum Logic.- Spectral Theory in Quantum Logics.- Semantics of the Minimal Logic of Quantum Mechanics.- Representations of Groups as Automorphisms on Orthomodular Lattices and Posets.- The Conditional in Abstract and Concrete Quantum Logic.- On the Logical Structure of Quantum Mechanics.- II.
Jaakko Hintikka, Robert E. Butts
openaire   +2 more sources

Reverse Mathematics and Computability Theory of Domain Theory

2019
This paper deals with the foundations of mathematics and computer science, domain theory in particular; the latter studies certain ordered sets, called domains, with close relations to topology. Conceptually speaking, domain theory provides a highly abstract and general formalisation of the intuitive notions ‘approximation’ and ‘convergence’.
openaire   +2 more sources

Mathematical Theory to Compute Stochastic Cellular Processes

2015
A central challenge of gene expression analysis during the last few decades has been the characterization of the expression patterns experimentally and theoretically. Modern techniques on single-cell and -molecule resolution reveal that transcriptions and translations are stochastic in time and that clonal population of cells displays heterogeneity in ...
Yoshitaka Kimura, Keita Iida
openaire   +2 more sources

Computational Methods for A Mathematical Theory of Evidence

2008
Many knowledge-based expert systems employ numerical schemes to represent evidence, rate competing hypoth eses, and guide search through the domains problem space. This paper has two objectives: first, to introduce one such scheme developed by Arthur Dempster and Glen Shafer, to a wider audience; second, to present results that can reduce the compu ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy