Pages that link to "Item:Q4670578"

The following pages link to Deciding Arithmetic Using <i>SAD</i> Computers (Q4670578):

Displaying 18 items.

• Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers (Q256428) (← links)
• A proof of the Geroch-Horowitz-Penrose formulation of the strong cosmic censor conjecture motivated by computability theory (Q352683) (← links)
• Computation as an unbounded process (Q418791) (← links)
• Malament-Hogarth machines and Tait's axiomatic conception of mathematics (Q488474) (← links)
• General relativistic hypercomputing and foundation of mathematics (Q734209) (← links)
• The computational status of physics (Q734210) (← links)
• A new problem for rule following (Q734211) (← links)
• Abstract geometrical computation. III: Black holes for classical and analog computing (Q734212) (← links)
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
• Supertasks do not increase computational power (Q1761709) (← links)
• Using Isabelle/HOL to verify first-order relativity theory (Q2351148) (← links)
• The case for hypercomputation (Q2497872) (← links)
• Embedding infinitely parallel computation in Newtonian kinematics (Q2497873) (← links)
• Relativistic computers and the Turing barrier (Q2497881) (← links)
• Twin paradox and the logical foundation of relativity theory (Q2505242) (← links)
• The physical Church thesis as an explanation of the Galileo thesis (Q2629933) (← links)
• Membrane system models for super-Turing paradigms (Q2629934) (← links)
• The dependence of computability on numerical notations (Q6088491) (← links)