Sciweavers

457 search results - page 3 / 92
» Hypercomputation: computing more than the Turing machine
Sort
View
AGI
2011
12 years 10 months ago
Measuring Agent Intelligence via Hierarchies of Environments
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...
Bill Hibbard
AIM
2005
13 years 6 months ago
If Not Turing's Test, Then What?
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them goo...
Paul R. Cohen
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 1 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
COLT
1992
Springer
13 years 10 months ago
On the Computational Power of Neural Nets
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
Hava T. Siegelmann, Eduardo D. Sontag
AMC
2006
104views more  AMC 2006»
13 years 6 months ago
Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical ta
-- Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A ...
Warren D. Smith