标签church-turing-thesis - 这是页1 - GeneraCodice

用一个输入的制作机器停止问题

https://www.generacodice.com/cn/articolo/2477858/用一个输入的制作机器停止问题
  turing-machines  -  church-turing-thesis
cs.stackexchange cs.stackexchange

语言l= {<m>，m接受一个有限量的单词}可解除的？</m>

https://www.generacodice.com/cn/articolo/2472944/语言l-m-m接受一个有限量的单词-可解除的-m
  turing-machines  -  undecidability  -  church-turing-thesis
cs.stackexchange cs.stackexchange

TM与改变TM之间的等价

https://www.generacodice.com/cn/articolo/2469207/tm与改变tm之间的等价
  turing-machines  -  computation-models  -  turing-completeness  -  church-turing-thesis
cs.stackexchange cs.stackexchange

About computable sets

https://www.generacodice.com/cn/articolo/2464272/about-computable-sets
  turing-machines  -  computability  -  discrete-mathematics  -  undecidability  -  church-turing-thesis
cs.stackexchange cs.stackexchange

关于图灵机的可计算性的一些问题

https://www.generacodice.com/cn/articolo/2443418/关于图灵机的可计算性的一些问题
  turing-machines  -  church-turing-thesis
cs.stackexchange cs.stackexchange

Can current quantum computers decide languages that Turing Machines cannot?

https://www.generacodice.com/cn/articolo/1809438/can-current-quantum-computers-decide-languages-that-turing-machines-cannot
  turing-machines  -  quantum-computing  -  undecidability  -  reductions  -  church-turing-thesis
cs.stackexchange cs.stackexchange

Turing machine where the next step is determined by the state and the symbols up to the read/write head

https://www.generacodice.com/cn/articolo/1615292/turing-machine-where-the-next-step-is-determined-by-the-state-and-the-symbols-up-to-the-read-write-head
  complexity-theory  -  turing-machines  -  church-turing-thesis
cs.stackexchange cs.stackexchange

How to come up with a language that is recognizable but not co-recognizable?

https://www.generacodice.com/cn/articolo/1613406/how-to-come-up-with-a-language-that-is-recognizable-but-not-co-recognizable
  turing-machines  -  church-turing-thesis
cs.stackexchange cs.stackexchange

Does this article imply that Turing-Computability is not the same as “effectively computable”?

https://www.generacodice.com/cn/articolo/1612429/does-this-article-imply-that-turing-computability-is-not-the-same-as-effectively-computable
  turing-machines  -  quantum-computing  -  church-turing-thesis
cs.stackexchange cs.stackexchange

Is turing completeness related to recursive enumerable languages?

https://www.generacodice.com/cn/articolo/1610927/is-turing-completeness-related-to-recursive-enumerable-languages
  turing-machines  -  turing-completeness  -  church-turing-thesis
cs.stackexchange cs.stackexchange
发现结果: 67
scroll top