Results 201 to 210 of about 16,392 (251)

Lectures on a Mathematical Theory of Computation (Mathematical Studies of Information Processing)

open access: yesLectures on a Mathematical Theory of Computation (Mathematical Studies of Information Processing)
openaire   +1 more source

Computational Complexity Theory and the Philosophy of Mathematics [PDF]

open access: yesPhilosophia Mathematica, 2019
Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems.
Walter Dean
exaly   +4 more sources
Some of the next articles are maybe not open access.

Related searches:

On mathematical theory of the duality computers

Quantum Information Processing, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangfu Zou   +4 more
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   +1 more source

Mathematical Theory of Duality Quantum Computers

Quantum Information Processing, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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   +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   +1 more source

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

Some Completeness Results in the Mathematical Theory of Computation

Journal of the ACM, 1968
A formal theory is described which incorporates the “assignment” function a ( i , k , ξ ) and the “contents” function c ( i , ξ ).
openaire   +2 more sources

Home - About - Disclaimer - Privacy