Results 141 to 150 of about 2,256,146 (190)
Some of the next articles are maybe not open access.

Computation and Computational Thinking

The Computer Journal, 2012
We recommend using the term Computation in conjunction with a well-defined model of computation whose semantics is clear and which matches the problem being investigated. Computer science already has a number of useful clearly defined models of computation whose behaviors and capabilities are well understood.
openaire   +1 more source

Computability in distributed computing

ACM SIGACT News, 2012
What can and cannot be computed in a distributed system is a complex function of the system's communication model, timing model, and failure model. This tutorial surveys some important results about computability in the canonical distributed system model, where processes execute asynchronously, they communicate by reading and writing shared memory, and
Maurice Herlihy   +2 more
openaire   +1 more source

Computer-aided computing

1995
Formal program design methods are most useful when supported with suitable mechanization. This need for mechanization has long been apparent, but there have been doubts whether verification technology could cope with the problems of scale and complexity.
openaire   +1 more source

Computers

Nursing Standard, 1991
The Department of Health has launched a new computer system for monitoring adverse drug reactions. The Adverse Drug Reactions On-line Information Tracking system (ADROIT) will allow reports to be processed in days rather than weeks, says the Department.
openaire   +2 more sources

On the Computational Complexity of Conservative Computing

2003
In a seminal paper published in 1982, Fredkin and Toffoli have introduced conservative logic, a mathematical model that allows one to describe computations which reflect some properties of microdynamical laws of Physics, such as reversibility and conservation of the internal energy of the physical system used to perform the computations. In particular,
MAURI, GIANCARLO   +1 more
openaire   +1 more source

Quantum Computers as Fuzzy Computers

2001
An implementation of digitised fuzzy numbers on quantum computers is suggested. It is shown that due to the famous quantum parallelism quantum computers can operate "globally" on whole membership functions of fuzzy numbers, not by calculating them "point by point" as classical computers do, which leads to the considerable decrease in the number of ...
Pykacz, Jaroslaw   +2 more
openaire   +2 more sources

Computers and Computing

2008
Abstract Before we can use a computer as a tool for scientific computing, we must gain a basic understanding of key concepts concerning physical components, communication protocols and procedures, programming, and the design of computational strategies implemented in algorithms.
openaire   +1 more source

A Computable Structure with Non-Standard Computability

Siberian Advances in Mathematics, 2017
Summary: We find an example of a computable admissible set whose level of computability is higher than that of the standard model of Peano arithmetic. As a byproduct, we construct a 1-decidable model of an undecidable submodel complete theory.
Avdeev, R. R., Puzarenko, V. G.
openaire   +3 more sources

Factoring: Algorithms, computations, and computers

The Journal of Supercomputing, 1987
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Computers and Computation

1986
Recent years have seen considerable progress in computer technology, in computer science, and in the computational sciences, which include computational chemistry. To a large extent developments in these fields have been mutually dependent. Progress in computer technology — such as the use of very-large-scale integrated circuits — has led to ...
openaire   +1 more source

Home - About - Disclaimer - Privacy