Tag halting-problem - Dies ist Seite 8 - GeneraCodice

Busy-Beaver-like question for WHILE-Programs (Theoretical CS)

https://www.generacodice.com/de/articolo/1620581/busy-beaver-like-question-for-while-programs-theoretical-cs
  computability  -  halting-problem  -  busy-beaver
cs.stackexchange cs.stackexchange

Since the halting problem is undecidable, does that mean that there exists an always undecidable program?

https://www.generacodice.com/de/articolo/1616595/since-the-halting-problem-is-undecidable-does-that-mean-that-there-exists-an-always-undecidable-program
  turing-machines  -  halting-problem  -  undecidability
cs.stackexchange cs.stackexchange

Variations of the halting problem

https://www.generacodice.com/de/articolo/1616025/variations-of-the-halting-problem
  halting-problem
cs.stackexchange cs.stackexchange

The Halting problem proof is wrong?

https://www.generacodice.com/de/articolo/1615886/the-halting-problem-proof-is-wrong
  complexity-theory  -  turing-machines  -  computability  -  halting-problem
cs.stackexchange cs.stackexchange

Probabilistic halting problem

https://www.generacodice.com/de/articolo/1615848/probabilistic-halting-problem
  halting-problem  -  undecidability  -  probabilistic-turing-machines
cs.stackexchange cs.stackexchange

Is halts-if-valid decideable?

https://www.generacodice.com/de/articolo/1614916/is-halts-if-valid-decideable
  computability  -  halting-problem  -  undecidability
cs.stackexchange cs.stackexchange

Reduction to proof undecidability of the problem: machine M and N accept infinitely many words

https://www.generacodice.com/de/articolo/1614828/reduction-to-proof-undecidability-of-the-problem-machine-m-and-n-accept-infinitely-many-words
  turing-machines  -  halting-problem  -  undecidability  -  reductions
cs.stackexchange cs.stackexchange

How to prove the language of Turing machines that run at most $4|x|^2$ steps is not recursive?

https://www.generacodice.com/de/articolo/1614816/how-to-prove-the-language-of-turing-machines-that-run-at-most-4-x-2-steps-is-not-recursive
  turing-machines  -  halting-problem  -  undecidability  -  reductions
cs.stackexchange cs.stackexchange

Can every Turing Machine be translated into a SAT formula?

https://www.generacodice.com/de/articolo/1613604/can-every-turing-machine-be-translated-into-a-sat-formula
  satisfiability  -  halting-problem
cs.stackexchange cs.stackexchange

Enumerate over all halting Turing Machines?

https://www.generacodice.com/de/articolo/1609779/enumerate-over-all-halting-turing-machines
  enumeration  -  turing-machines  -  halting-problem
cs.stackexchange cs.stackexchange
Gefundene Ergebnisse: 342
scroll top