Pages that link to "Item:Q2497884"

The following pages link to Church's thesis meets the \(N\)-body problem (Q2497884):

Displaying 15 items.

• Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
• Synthesizing invariant barrier certificates via difference-of-convex programming (Q832194) (← links)
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
• Computability on reals, infinite limits and differential equations (Q990444) (← links)
• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
• Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
• Physical constraints on hypercomputation (Q2482458) (← links)
• Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
• How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
• Relativistic computers and the Turing barrier (Q2497881) (← links)
• Mathematical and Technological Computability (Q4972862) (← links)
• Computability of Differential Equations (Q5024569) (← links)
• A Survey on Analog Models of Computation (Q5024572) (← links)
• Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems (Q5326355) (← links)
• Experimental computation of real numbers by Newtonian machines (Q5438843) (← links)