Relativistic Computation

Andréka, Hajnal; Madarász, Judit X.; Németi, István; Németi, Péter; Székely, Gergely

doi:10.1017/9781316759745.010

Cited by 32 publications

(6 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It would be a stunning fact if the class of functions computable by humans with finite instructions and pencil and paper would exhaust the universe's computational abilities. 21 See Piccinini (2015, Ch.16) and Andréka et al (2018) for a more complete discussion of these issues.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Physics and Computation

Duwell

2021

View full text Add to dashboard Cite

This Element has three main aims. First, it aims to help the reader understand the concept of computation that Turing developed, his corresponding results, and what those results indicate about the limits of computational possibility. Second, it aims to bring the reader up to speed on analyses of computation in physical systems which provide the most general characterizations of what it takes for a physical system to be a computational system. Third, it aims to introduce the reader to some different kinds of quantum computers, describe quantum speedup, and present some explanation sketches of quantum speedup. If successful, this Element will equip the reader with a basic knowledge necessary for pursuing these topics in more detail.

show abstract

Section: Discussionmentioning

confidence: 99%

“…So, the signal will destroy TM 2 , and the computation will fail. Andréka, Madarász, Németi, Németi, and Székely (2018) are uncontroversially physically possible to execute that will allow one to transcend the bounds of Turing computability. 21…”

Section: The Maximality Thesismentioning

confidence: 99%

Physics and Computation

Duwell

2021

View full text Add to dashboard Cite

show abstract

“…55 Pitowsky (1990) is based on a lecture he gave in 1986-about the same time that Istvan Németi proposed his construction of relativistic computation (Andréka et al 2018). 56 See Hogarth (1994: 127-133).…”

Section: Relativistic Computationmentioning

confidence: 99%

“…What about the physicality of RM? Németi and his colleagues provide the most physically realistic construction, placing machines like RM in setups that include huge slow-rotating Kerr black holes (Andréka et al 2018), and emphasizing that the computation is physical in the sense that "the principles of quantum mechanics are not violated" and RM is "not in conflict with presently accepted scientific principles" (Andréka, Németi, and Németi 2009: 501). They suggest that humans might "even build" their relativistic computer "sometime in the future" (Andréka, Németi, and Németi 2009: 511).…”

Section: Does Relativistic Computation Refute Thementioning

confidence: 99%

The Nature of Physical Computation

Shagrir¹

2022

View full text Add to dashboard Cite

Computing systems are everywhere today. Even the brain is thought to be a sort of computing system. But what does it mean to say that a given organ or system computes? What is it about laptops, smartphones, and nervous systems that they are deemed to compute, and why does it seldom occur to us to describe stomachs, hurricanes, rocks, or chairs that way? The book provides an extended argument for the semantic view of computation, which states that semantic properties are involved in the nature of computing systems. Laptops, smartphones, and nervous systems compute because they are accompanied by representations. Stomachs, hurricanes, and rocks, for instance, which do not have semantic properties, do not compute. The first part of the book argues that the linkage between the mathematical theory of computability and the notion of physical computation is weak. Theoretical notions such as algorithms, effective procedure, program, and automaton play only a minor role in identifying physical computation. The second part of the book reviews three influential accounts of physical computation and argues that while none of these accounts is satisfactory, each of them highlights certain key features of physical computation. The final part of the book develops and argues for a semantic account of physical computation and offers a characterization of computational explanations.

show abstract

“…We begin with a few preliminaries concerning the relevant background formalism of general relativity. 1 An n-dimensional, relativistic spacetime (for n ≥ 2) is a pair of mathematical objects (M, g ab ): M is a smooth (connected) n-dimensional manifold and g ab is a smooth metric on M of Lorentz signature (+, −, ..., −). Note that M is assumed to be Hausdorff; for any distinct p, q ∈ M , one can find disjoint open sets O p and O q containing p and q respectively.…”

Section: Preliminariesmentioning

confidence: 99%