The following pages link to (Q4231133):
Displaying 50 items.
- Computation with perturbed dynamical systems (Q355515) (← links)
- The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) (Q391177) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- On probabilistic analog automata (Q596111) (← links)
- A dynamical model of parallel computation on bi-infinite time-scale (Q629413) (← links)
- Universe creation on a computer (Q640097) (← links)
- Expressive power of first-order recurrent neural networks determined by their attractor dynamics (Q736603) (← links)
- Infinite traces and symbolic dynamics (Q841627) (← links)
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
- A note on discreteness and virtuality in analog computing (Q870262) (← links)
- On mind \& Turing's machines (Q885688) (← links)
- Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
- Computability on reals, infinite limits and differential equations (Q990444) (← links)
- A new conceptual framework for analog computation (Q1022610) (← links)
- Against digital ontology (Q1036042) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- Controlling the global behavior of coupled chaotic systems by means of energy regulation. (Q1419063) (← links)
- Analog computers and recursive functions over the reals. (Q1426051) (← links)
- Exponential transients in continuous-time Liapunov systems. (Q1426460) (← links)
- Continuous-time computation with restricted integration capabilities (Q1434373) (← links)
- Stochastic analog networks and computational complexity (Q1578510) (← links)
- Quasi-periodic \(\beta\)-expansions and cut languages (Q1704578) (← links)
- Computational capabilities of analog and evolving neural networks over infinite input streams (Q1713481) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- An optical model of computation (Q1779303) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- Analog neuron hierarchy (Q1982432) (← links)
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations (Q2104133) (← links)
- Subrecursive neural networks (Q2183681) (← links)
- Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
- Parallel computation in spiking neural nets (Q2455594) (← links)
- Computability with polynomial differential equations (Q2482915) (← links)
- The case for hypercomputation (Q2497872) (← links)
- Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
- A hypercomputational alien (Q2497874) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
- Deep limits of residual neural networks (Q2679108) (← links)
- The impact of models of a physical oracle on computational power (Q2919942) (← links)
- Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics (Q2945562) (← links)
- Limits to measurement in experiments governed by algorithms (Q3061157) (← links)
- On the Complexity of Measurement in Classical Physics (Q3502630) (← links)
- Oracles and Advice as Measurements (Q3543332) (← links)
- Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines (Q4642549) (← links)
- A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle (Q4686644) (← links)
- On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism (Q4686646) (← links)
- The Significance of Relativistic Computation for the Philosophy of Mathematics (Q5015969) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
