Results 1  10
of
38,691
NONCOMPUTABLE FUNCTIONS IN THE BLUMSHUBSMALE MODEL ∗
, 2010
"... Vol. 7 (2:15) 2011, pp. 1–20 www.lmcsonline.org ..."
Creative Commons Attribution License. The Cardinality of an Oracle in BlumShubSmale Computation
"... We examine the relation of BSSreducibility on subsets of R. The question was asked recently (and anonymously) whether it is possible for the halting problem H in BSScomputation to be BSSreducible to a countable set. Intuitively, it seems that a countable set ought not to contain enough informatio ..."
Abstract
 Add to MetaCart
We examine the relation of BSSreducibility on subsets of R. The question was asked recently (and anonymously) whether it is possible for the halting problem H in BSScomputation to be BSSreducible to a countable set. Intuitively, it seems that a countable set ought not to contain enough
Output Sets, Halting Sets and an Arithmetical Hierarchy for Ordered Subrings of the Real Numbers under Blum/Shub/Smale Computation
, 1994
"... The original exposition of Blum/Shub/Smale computation for subrings and subfields of real numbers (1989) asks how generally output and halting sets coincide. Aspects of this question were subsequently addressed by Michaux, Byerly, and Friedman /Mansfield. This document synthesizes, simplifies, and e ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The original exposition of Blum/Shub/Smale computation for subrings and subfields of real numbers (1989) asks how generally output and halting sets coincide. Aspects of this question were subsequently addressed by Michaux, Byerly, and Friedman /Mansfield. This document synthesizes, simplifies
Decidability Of The Graph Of A Map In The Model Of Blum, Shub And Smale
, 1996
"... It is shown that in the theory of computation over a ring proposed by Blum, Shub and Smale in [BlShS1], the computability of a map is equivalent to the decidability of its graph if the ring is an algebraically closed field, while over IR, there exist non computable functions whose graphs neverthel ..."
Abstract
 Add to MetaCart
is computable. Conversely, to compute f at a given y, one enumerates the integers t in increasing order, using a decision procedure for G f to check whether (y; t) belongs to G f until the value t = f(y) for which it answers yes is reached. In [BlShS1], L. Blum, M. Shub and S. Smale have developped a general
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consi ..."
Abstract

Cited by 1103 (7 self)
 Add to MetaCart
into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their computational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number
A survey of generalpurpose computation on graphics hardware
, 2007
"... The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the l ..."
Abstract

Cited by 545 (18 self)
 Add to MetaCart
the main body of this report at two separate audiences. First, we describe the techniques used in mapping generalpurpose computation to graphics hardware. We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques. Second
Formalising trust as a computational concept
, 1994
"... Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? T ..."
Abstract

Cited by 518 (5 self)
 Add to MetaCart
Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? This thesis provides a clarification of trust. We present a formalism for trust which provides us with a tool for precise discussion. The formalism is implementable: it can be embedded in an artificial agent, enabling the agent to make trustbased decisions. Its applicability in the domain of Distributed Artificial Intelligence (DAI) is raised. The thesis presents a testbed populated by simple trusting agents which substantiates the utility of the formalism. The formalism provides a step in the direction of a proper understanding and definition of human trust. A contribution of the thesis is its detailed exploration of the possibilities of future work in the area. Summary 1. Overview This thesis presents an overview of trust as a social phenomenon and discusses it formally. It argues that trust is: • A means for understanding and adapting to the complexity of the environment. • A means of providing added robustness to independent agents. • A useful judgement in the light of experience of the behaviour of others. • Applicable to inanimate others. The thesis argues these points from the point of view of artificial agents. Trust in an artificial agent is a means of providing an additional tool for the consideration of other agents and the environment in which it exists. Moreover, a formalisation of trust enables the embedding of the concept into an artificial agent. This has been done, and is documented in the thesis. 2. Exposition There are places in the thesis where it is necessary to give a broad outline before going deeper. In consequence it may seem that the subject is not receiving a thorough treatment, or that too much is being discussed at one time! (This is particularly apparent in the first and second chapters.) To present a thorough understanding of trust, we have proceeded breadth first in the introductory chapters. Chapter 3 expands, depth first, presenting critical views of established researchers.
Efficiently computing static single assignment form and the control dependence graph
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1991
"... In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single ass ..."
Abstract

Cited by 997 (8 self)
 Add to MetaCart
, the difficulty of their construction and their potential size have discouraged their use. We present new algorithms that efficiently compute these data structures for arbitrary control flow graphs. The algorithms use dominance frontiers, a new concept that may have other applications. We also give analytical
Face Recognition: A Literature Survey
, 2000
"... ... This paper provides an uptodate critical survey of still and videobased face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an uptodate review of the existing literature, and the second is to offer some insights into ..."
Abstract

Cited by 1363 (21 self)
 Add to MetaCart
... This paper provides an uptodate critical survey of still and videobased face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an uptodate review of the existing literature, and the second is to offer some insights
Results 1  10
of
38,691