Theory of Computation

Why is the Turing machine considered effective computation if it's not realizable due to the Bekenstein bound?

• url: https://cs.stackexchange.com/questions/168182/why-is-the-turing-machine-considered-effective-computation-if-its-not-realizabl

.

Other Undecidable Problems (wayback)

• url: https://web.archive.org/web/20210507040412/https://www.cs.wcupa.edu/rkline/fcs/other-undecidable.html

.

Scooping the Loop Snooper --- Geoffrey K. Pullum

• url: http://www.lel.ed.ac.uk/~gpullum/loopsnoop.html

.

Shtetl-Optimized » Blog Archive » Rosser's Theorem via Turing machines

• url: https://www.scottaaronson.com/blog/?p=710

.

Are there any undecidability results that are not known to have a diagonal argument proof?

• url: https://mathoverflow.net/questions/454105/are-there-any-undecidability-results-that-are-not-known-to-have-a-diagonal-argum

.

Is there a finite-dimensional vector space whose dimension cannot be found?

• url: http://mathoverflow.net/questions/77068/is-there-a-finite-dimensional-vector-space-whose-dimension-cannot-be-found

.

Algorithmic Information Theory

• is-heading: true

.

The Limits of Reason (Gregory Chaitin)

• url: https://web.archive.org/web/20140812152541/https://www.cs.auckland.ac.nz/~chaitin/sciamer3.html

.