Tag decision-problem - This is page 6 - GeneraCodice

Is the problem of deciding whether two programs have the same semantics decidable?

https://www.generacodice.com/en/articolo/2442581/is-the-problem-of-deciding-whether-two-programs-have-the-same-semantics-decidable
  semantics  -  undecidability  -  decision-problem
cs.stackexchange cs.stackexchange

TM decidable or undecidable problem

https://www.generacodice.com/en/articolo/2442421/tm-decidable-or-undecidable-problem
  turing-machines  -  undecidability  -  decision-problem
cs.stackexchange cs.stackexchange

Are there any proofs of exponential lower bound time complexity

https://www.generacodice.com/en/articolo/1810500/are-there-any-proofs-of-exponential-lower-bound-time-complexity
  complexity-theory  -  time-complexity  -  decision-problem
cs.stackexchange cs.stackexchange

Decide whether an $n$-bit positive integer is composite

https://www.generacodice.com/en/articolo/1809888/decide-whether-an-n-bit-positive-integer-is-composite
  complexity-theory  -  np-complete  -  np  -  decision-problem
cs.stackexchange cs.stackexchange

Decidability of decision problems

https://www.generacodice.com/en/articolo/1616752/decidability-of-decision-problems
  turing-machines  -  undecidability  -  semi-decidability  -  decision-problem  -  rice-theorem
cs.stackexchange cs.stackexchange

Complement of languages and coNP

https://www.generacodice.com/en/articolo/1616053/complement-of-languages-and-conp
  complexity-theory  -  formal-languages  -  decision-problem  -  co-np
cs.stackexchange cs.stackexchange

is FIND WORDS in P?

https://www.generacodice.com/en/articolo/1615834/is-find-words-in-p
  np  -  decision-problem
cs.stackexchange cs.stackexchange

Verifying Hamiltonian Cycle solution in O(n^2), n is the length of the encoding of G

https://www.generacodice.com/en/articolo/1615422/verifying-hamiltonian-cycle-solution-in-o-n-2-n-is-the-length-of-the-encoding-of-g
  np-complete  -  np-hard  -  np  -  decision-problem  -  hamiltonian-circuit
cs.stackexchange cs.stackexchange

Show that there are infinitely more problems than we will ever be able to compute

https://www.generacodice.com/en/articolo/1615102/show-that-there-are-infinitely-more-problems-than-we-will-ever-be-able-to-compute
  computability  -  proof-techniques  -  decision-problem  -  uncountability
cs.stackexchange cs.stackexchange

Subset with modified condition, is it still NP-complete? [closed]

https://www.generacodice.com/en/articolo/1613015/subset-with-modified-condition-is-it-still-np-complete-closed
  np-complete  -  np-hard  -  decision-problem
cs.stackexchange cs.stackexchange
Results found: 400
scroll top