The following pages link to (Q4792712):
Displayed 20 items.
- Computing with polynomial ordinary differential equations (Q306694) (← links)
- Computation as an unbounded process (Q418791) (← links)
- Ideal negative conceivability and the halting problem (Q485625) (← links)
- Sharvy's Lucy and Benjamin puzzle (Q1005962) (← links)
- Super-tasks, accelerating Turing machines and uncomputability (Q1434371) (← links)
- The concept of computability (Q1434377) (← links)
- Hypercomputation: Philosophical issues (Q1434379) (← links)
- Supertasks do not increase computational power (Q1761709) (← links)
- Physical constraints on hypercomputation (Q2482458) (← links)
- The Church-Turing thesis: Still valid after all these years? (Q2497878) (← links)
- The many forms of hypercomputation (Q2497883) (← links)
- Zeno machines and hypercomputation (Q2503270) (← links)
- THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' (Q2842654) (← links)
- A note on accelerated Turing machines (Q3061156) (← links)
- Multi-Resolution Cellular Automata for Real Computation (Q3091455) (← links)
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
- The Significance of Relativistic Computation for the Philosophy of Mathematics (Q5015969) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- What is the Church-Turing Thesis? (Q5055286) (← links)
- Accelerating machines: a review (Q5451177) (← links)