The following pages link to Building Infinite Machines (Q4483956):
Displaying 17 items.
- Computing with polynomial ordinary differential equations (Q306694) (← links)
- A new problem for rule following (Q734211) (← links)
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
- How to build an infinite lottery machine (Q1616145) (← links)
- Supertasks do not increase computational power (Q1761709) (← links)
- Building a model of a useful Turing machine (Q1975337) (← links)
- Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
- The many forms of hypercomputation (Q2497883) (← links)
- Hyperloops Do Not Threaten the Notion of an Effective Procedure (Q3576039) (← links)
- On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism (Q4686646) (← links)
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Physical Computability Theses (Q5119662) (← links)
- Accelerating machines: a review (Q5451177) (← links)
- The dependence of computability on numerical notations (Q6088491) (← links)
- Editors' introduction (Q6594560) (← links)
- Programming infinite machines (Q6651284) (← links)