Tag halting-problem - Это страница 30 - GeneraCodice

Why is the halting problem decidable for LBA?

https://www.generacodice.com/ru/articolo/1495040/why-is-the-halting-problem-decidable-for-lba
  turing-machines  -  automata  -  halting-problem  -  undecidability  -  linear-bounded-automata
cs.stackexchange cs.stackexchange

Why is the halting problem unsolvable by a turing machine? [duplicate]

https://www.generacodice.com/ru/articolo/1490979/why-is-the-halting-problem-unsolvable-by-a-turing-machine-duplicate
  computability  -  halting-problem
cs.stackexchange cs.stackexchange

Is the halting problem specific to Turing machines?

https://www.generacodice.com/ru/articolo/1490181/is-the-halting-problem-specific-to-turing-machines
  turing-machines  -  halting-problem
cs.stackexchange cs.stackexchange

Is there a TM that halts on all inputs but that property is not provable?

https://www.generacodice.com/ru/articolo/1489302/is-there-a-tm-that-halts-on-all-inputs-but-that-property-is-not-provable
  turing-machines  -  computability  -  halting-problem  -  reference-request
cs.stackexchange cs.stackexchange

How does this proof, that the halting problem is undecidable, work?

https://www.generacodice.com/ru/articolo/1366669/how-does-this-proof-that-the-halting-problem-is-undecidable-work
  halting-problem
StackOverflow StackOverflow

The use of System.currentTimeMillis() in loops in Java [closed]

https://www.generacodice.com/ru/articolo/1344812/the-use-of-system-currenttimemillis-in-loops-in-java-closed
  java  -  halting-problem
StackOverflow StackOverflow

Можно ли записан метод, если язык неразрешен?

https://www.generacodice.com/ru/articolo/1127493/можно-ли-записан-метод-если-язык-неразрешен
  halting-problem  -  formal-grammars  -  undecidability  -  turing-completeness  -  decision-problem
cs.stackexchange cs.stackexchange

Смущая эквивалентность $ phi (n, n) downarrow leftrightarrow text {halt} (n, n) $

https://www.generacodice.com/ru/articolo/1126989/смущая-эквивалентность-phi-n-n-downarrow-leftrightarrow-text-halt-n-n
  computability  -  halting-problem
cs.stackexchange cs.stackexchange

Альтернативное доказательство неразрешимости $A_{TM}$

https://www.generacodice.com/ru/articolo/1126457/альтернативное-доказательство-неразрешимости-a-tm
  turing-machines  -  terminology  -  computability  -  halting-problem
cs.stackexchange cs.stackexchange

Способен ли Oracle Computer на бесконечные петли?

https://www.generacodice.com/ru/articolo/1124721/способен-ли-oracle-computer-на-бесконечные-петли
  turing-machines  -  halting-problem  -  oracle-machines
cs.stackexchange cs.stackexchange
Результаты найдены: 342
scroll top