965 resultados para incremental computation


Relevância:

20.00% 20.00%

Publicador:

Resumo:

"The present volume has been reconstructed from the folio edition by a literary friend [John Sharpe] ... the ... revision of the manuscript ... having been intrusted to myself."--Sir Henry Ellis, in preface (dated 1844) cf. also Lowndes.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Shipping list no.: 87-677-P.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

"Embodies a course given by the writer for a number of years in the mathematical laboratory of the Massachusetts Institute of Technology."

Relevância:

20.00% 20.00%

Publicador:

Resumo:

At head of cover title: Generalized computer program.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Description based on: 1890.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Title Varies: 1898-1905, Statement of the Computation and Apportionment of the State Levy of Taxes; ?-1897, Statement of the Expenses To Which the State of Oregon Will Be Subjected for the Year 18?-1897 and of the Items of Deficiencies More

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Church-Turing Thesis is widely regarded as true, because of evidence that there is only one genuine notion of computation. By contrast, there are nowadays many different formal logics, and different corresponding foundational frameworks. Which ones can deliver a theory of computability? This question sets up a difficult challenge: the meanings of basic mathematical terms (like "set", "function", and "number") are not stable across frameworks. While it is easy to compare what different frameworks say, it is not so easy to compare what they mean. We argue for some minimal conditions that must be met if two frameworks are to be compared; if frameworks are radical enough, comparison becomes hopeless. Our aim is to clarify the dialectical situation in this bourgeoning area of research, shedding light on the nature of non-classical logic and the notion of computation alike.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

"Air research and Development Command, Air Force Office of Scientific Research, Mechanics Division. Contract no. AF 49(638) - 498."

Relevância:

20.00% 20.00%

Publicador:

Resumo:

At head of cover title : Generalized computer program.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The field of linear optical quantum computation (LOQC) will soon need a repertoire of experimental milestones. We make progress in this direction by describing several experiments based on Grover's algorithm. These experiments range from a relatively simple implementation using only a single nonscalable controlled- NOT (CNOT) gate to the most complex, requiring two concatenated scalable CNOT gates, and thus form a useful set of early milestones for LOQC. We also give a complete description of basic LOQC using polarization-encoded qubits, making use of many simplifications to the original scheme of Knill, Laflamme, and Milburn [E. Knill, R. Laflamme, and G. J. Milburn, Nature (London) 409, 46 (2001)].

Relevância:

20.00% 20.00%

Publicador:

Resumo:

What resources are universal for quantum computation? In the standard model of a quantum computer, a computation consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This requirement for coherent unitary dynamical operations is widely believed to be the critical element of quantum computation. Here we show that a very different model involving only projective measurements and quantum memory is also universal for quantum computation. In particular, no coherent unitary dynamics are involved in the computation. (C) 2003 Elsevier Science B.V. All rights reserved.