Pages that link to "Item:Q1426051"

The following pages link to Analog computers and recursive functions over the reals. (Q1426051):

Displaying 30 items.

• Computing with polynomial ordinary differential equations (Q306694) (← links)
• Real recursive functions and their hierarchy (Q706790) (← links)
• A characterization of computable analysis on unbounded domains using differential equations (Q719239) (← links)
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
• Computability of analog networks (Q870263) (← links)
• Computability on reals, infinite limits and differential equations (Q990444) (← links)
• A new conceptual framework for analog computation (Q1022610) (← links)
• A foundation for real recursive function theory (Q1032628) (← links)
• Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
• Computational bounds on polynomial differential equations (Q1036531) (← links)
• On the functions generated by the general purpose analog computer (Q1680506) (← links)
• A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
• Programming with ordinary differential equations: some first steps towards a programming language (Q2104250) (← links)
• Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs (Q2142105) (← links)
• Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
• Real-time computability of real numbers by chemical reaction networks (Q2400944) (← links)
• Computability with polynomial differential equations (Q2482915) (← links)
• The P\(\neq\) NP conjecture in the context of real and complex analysis (Q2489146) (← links)
• Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
• Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions (Q2581262) (← links)
• Axiomatizing Analog Algorithms (Q3188259) (← links)
• Characterizing Computable Analysis with Differential Equations (Q4918002) (← links)
• Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
• Computability of Differential Equations (Q5024569) (← links)
• A Survey on Analog Models of Computation (Q5024572) (← links)
• A Universal Ordinary Differential Equation (Q5109517) (← links)
• Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)
• Computational complexity with experiments as oracles (Q5505107) (← links)
• Characterizing time computational complexity classes with polynomial differential equations (Q5880938) (← links)
• A continuous characterization of PSPACE using polynomial ordinary differential equations (Q6155896) (← links)