Newbetuts
.
New posts in turing-machines
Show that minimal CFG is undecidable (Sipser 5.36)
computational-complexity
context-free-grammar
turing-machines
Hopping to infinity along a string of digits
sequences-and-series
recreational-mathematics
irrational-numbers
decimal-expansion
turing-machines
What's a Turing machine?
computer-science
theory
turing-machines
computability
Show that the question "Is there life beyond earth?" is decidable
computability
turing-machines
Text books on computability
reference-request
computability
big-list
book-recommendation
turing-machines
Please explain this Turing Machine simulator written in Prolog
prolog
turing-machines
What is the difference between a shuffle and a permutation?
formal-languages
turing-machines
The mother of all undecidable problems
logic
computer-science
computational-complexity
computability
turing-machines
Why can Conway’s Game of Life be classified as a universal machine?
theory
turing-machines
turing-complete
computability
Turing machine vs Von Neuman machine
computer-science
cpu-architecture
turing-machines
von-neumann
When have you come upon the halting problem in the field? [closed]
language-agnostic
field
theory
turing-machines
halting-problem
What breaks the Turing Completeness of simply typed lambda calculus?
turing-machines
lambda-calculus
type-theory
How do we know that the P versus NP problem is an NP problem itself?
computer-science
computational-complexity
turing-machines
Proving a language is not recognizable
proof-verification
formal-languages
turing-machines
How large is the set of all Turing machines?
elementary-set-theory
turing-machines
How to show that if there's a mapping reduction from L to its complement, it doesn't imply that L∈R?
computer-science
computability
formal-languages
turing-machines
decidability
Where is the theorem related to the construction of countable admissible ordinals by Turing machines with oracles?
logic
reference-request
ordinals
turing-machines
oracles
Why did nobody prove undecidability by the "too many problems" argument?
math-history
turing-machines
How can Busy beaver($10 \uparrow \uparrow 10$) have no provable upper bound?
computability
turing-machines
How can we know we're not accidentally talking about non-standard integers?
logic
model-theory
proof-theory
turing-machines
incompleteness
Prev
Next