Ratings by cpressey of Theory of Computation works

Computation: Finite and Infinite Machines

• rating: classic

.

The Universal Turing Machine

• rating: 3

.

Theory of Recursive Functions and Effective Computability

• rating: TODO

.

Automata and Computability

• rating: 1

.

Theory of Computation

• rating: 0

.

Theories of Computation

• rating: 1

.

Computability Theory, Semantics, and Logic Programming

• rating: TODO

.

Theory of Deductive Systems and its Applications

• rating: 3

.

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

• rating: 1

.

Other Undecidable Problems (wayback)

• rating: 1

.

Scooping the Loop Snooper --- Geoffrey K. Pullum

• rating: 1

.

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

• rating: 1

.

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

• rating: 1

.

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

• rating: 1

.

Algorithmic Information Theory

• rating: TODO

.

The Limits of Reason (Gregory Chaitin)

• rating: 1

.