Results 251 to 260 of about 941,214 (304)
Some of the next articles are maybe not open access.
The Computer Journal, 2012
In this essau we claim that omputing is the fourth great scientific domain, on par with the physical, life, and social sciences.
openaire +2 more sources
In this essau we claim that omputing is the fourth great scientific domain, on par with the physical, life, and social sciences.
openaire +2 more sources
SIAM Review, 1998
Alternative methods are introduced to compute \(A^n\) for nonsingular matrices \(A\). The methods are based on the Cayley-Hamilton theorem and are pedagogically simpler than the well-known transformation method.
Saber Elaydi, William A. Harris Jr.
openaire +2 more sources
Alternative methods are introduced to compute \(A^n\) for nonsingular matrices \(A\). The methods are based on the Cayley-Hamilton theorem and are pedagogically simpler than the well-known transformation method.
Saber Elaydi, William A. Harris Jr.
openaire +2 more sources
Computability in distributed computing
ACM SIGACT News, 2012What 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 +2 more sources
Computation and Computational Thinking
The Computer Journal, 2012We 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 +2 more sources
On the Computational Complexity of Conservative Computing
2003In 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 +2 more sources
Quantum Computers as Fuzzy Computers
2001An 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 ...
Jaroslaw Pykacz +2 more
openaire +3 more sources
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 +2 more sources
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 +2 more sources
Factoring: Algorithms, computations, and computers
The Journal of Supercomputing, 1987zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
That's not computing- thisis computing
Computer, 2003We've all become blase about our computing: computers in our pockets, in our washing machines, controlling our car engines, in our greeting cards, in our ski boots and tennis shoes. The giddy sense of amazement, of possibility, has gradually given way to complacency and a vague sense of unfulfilled entitlement.
openaire +2 more sources
A Computable Structure with Non-Standard Computability
Siberian Advances in Mathematics, 2017Summary: 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