Pages that link to "Item:Q5302226"
From MaRDI portal
The following pages link to The Extent of Computation in Malament–Hogarth Spacetimes (Q5302226):
Displaying 16 items.
- 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)
- A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer (Q514550) (← links)
- General relativistic hypercomputing and foundation of mathematics (Q734209) (← links)
- Abstract geometrical computation. III: Black holes for classical and analog computing (Q734212) (← links)
- Pi on earth, or mathematics in the real world (Q948981) (← 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)
- Note on a reformulation of the strong cosmic censor conjecture based on computability (Q1850416) (← links)
- Hyperloops Do Not Threaten the Notion of an Effective Procedure (Q3576039) (← links)
- The Significance of Relativistic Computation for the Philosophy of Mathematics (Q5015969) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Physical Computability Theses (Q5119662) (← links)
- A holographic bound on the total number of computations in the visible universe (Q5249413) (← links)
- Machines, Computations, and Universality (Q5710876) (← links)
- The dependence of computability on numerical notations (Q6088491) (← links)