scientific article; zbMATH DE number 1260390
From MaRDI portal
Publication:4231133
zbMath0912.68161MaRDI QIDQ4231133
Publication date: 10 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
An analog characterization of the Grzegorczyk hierarchy, Polynomial differential equations compute all real computable functions on computable compact intervals, Infinite traces and symbolic dynamics, What is the Church-Turing Thesis?, The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems, The impact of models of a physical oracle on computational power, Computation with perturbed dynamical systems, Can Newtonian systems, bounded in space, time, mass and energy compute all functions?, A note on discreteness and virtuality in analog computing, On probabilistic analog automata, Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics, On mind \& Turing's machines, The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\), Subrecursive neural networks, Three analog neurons are Turing universal, Deep limits of residual neural networks, On the Complexity of Measurement in Classical Physics, The Power of Machines That Control Experiments, A dynamical model of parallel computation on bi-infinite time-scale, The expressive power of analog recurrent neural networks on infinite input streams, Quasi-periodic \(\beta\)-expansions and cut languages, Universe creation on a computer, Controlling the global behavior of coupled chaotic systems by means of energy regulation., Computational capabilities of analog and evolving neural networks over infinite input streams, Analog computers and recursive functions over the reals., Exponential transients in continuous-time Liapunov systems., Oracles and Advice as Measurements, Continuous-time computation with restricted integration capabilities, Analog computation through high-dimensional physical chaotic neuro-dynamics, Parallel computation in spiking neural nets, Analog neuron hierarchy, Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines, A survey of computational complexity results in systems and control, Computability with polynomial differential equations, Cut Languages in Rational Bases, THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY, A probabilistic model of computing with words, The case for hypercomputation, Embedding infinitely parallel computation in Newtonian kinematics, A hypercomputational alien, How much can analog and hybrid systems be proved (super-)Turing, An optical model of computation, Experimental computation of real numbers by Newtonian machines, Computability on reals, infinite limits and differential equations, A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle, On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism, Limits to measurement in experiments governed by algorithms, Accelerating machines: a review, Expressive power of first-order recurrent neural networks determined by their attractor dynamics, A new conceptual framework for analog computation, Against digital ontology, Computations via Newtonian and relativistic kinematic systems, What is a universal computing machine?, Stochastic analog networks and computational complexity, Neuronal integration of dynamic sources: Bayesian learning and Bayesian inference, Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions, The Significance of Relativistic Computation for the Philosophy of Mathematics, A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations, A Survey on Analog Models of Computation
