Results 281 to 290 of about 491,707 (327)
Some of the next articles are maybe not open access.
Mathematical Theory of Serial Computers
1976About 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, 1970In 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
Development of Mathematical Theory in Computer Vision
2014This 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
Logic, Foundations of Mathematics, and Computability Theory
1977I. 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
2019This 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
2015A 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
2008Many 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
A Mathematical Theory of Energy Efficient Neural Computation and Communication
IEEE Transactions on Information Theory, 2010A neuroscience-based mathematical model of how a neuron stochastically processes data and communicates information is introduced and analyzed. Call the neuron in question 'neuron j", or just "j". The information j transmits approximately describes the time-varying intensity of the excitation j is continuously experiencing from neural spike trains ...
Toby Berger, William B. Levy
openaire +1 more source
A Mathematical Theory of NMR Quantum Computations
2002In this paper, we develop a theory of bulk quantum computations such as NMR (Nuclear Magnetic Resonance) quantum computations. For this purpose, we first define bulk quantum Turing machines (BQTMs for short) as a model of bulk quantum computation. Then, we define complexity classes EBQP, BBQP and ZBQP as counterparts of the quantum complexity classes ...
openaire +2 more sources
2013
Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of ...
openaire +2 more sources
Adapted from a modular undergraduate course on computational mathematics, Concise Computer Mathematics delivers an easily accessible, self-contained introduction to the basic notions of mathematics necessary for a computer science degree. The text reflects the need to quickly introduce students from a variety of educational backgrounds to a number of ...
openaire +2 more sources