Search results

The emptiness problem is [[Undecidable problem|undecidable]] for [[context-sensitive grammar]]s, a fact that follows from the undecida [[Category:Polynomial-time problems]] ...

...{{cite arXiv |last=Poonen |first=Bjorn |date=2014-10-25 |title=Undecidable problems: a sampler |class=math.LO |eprint=1204.0299 }}</ref>{{Rp|pages=9–11}} ...4, the homeomorphism problem for ''d''-dimensional simplicial complexes is undecidable.<ref>{{Cite web |title=A. Markov, "The insolubility of the problem of homeo ...

...ef>{{Cite journal | first=Daniel | last=Richardson | title=Some Unsolvable Problems Involving Elementary Functions of a Real Variable | journal=[[Journal of Sy ...ssion is non-zero, or of showing that the problem is [[undecidable problem|undecidable]]. For example, if ''x''₁,&nbsp;...,&nbsp;''x''_''n'' ...

.../www.jstor.org/stable/1969933 ''Recursive unsolvability of group theoretic problems''], [[Annals of Mathematics]] (2), vol. 67, 1958, pp. 172–194</ref> ...<math>G=\langle X \mid R\rangle</math> be a finitely presented group with undecidable word problem, whose existence is provided by the [[Novikov–Boone theorem]]. ...

...rem, which states that all non-trivial semantic properties of programs are undecidable. The theorem has the immediate consequence that it is an [[undecidable problem]] to determine if two lambda terms are β-equivalent. ...

Most problem related to perfect channel system are undecidable{{r|decidable|p=92}}.<ref name="easier">{{cite journal |last1=Cécé |first1=G ...st1=Richard|last1=Mayr|doi=10.1016/S0304-3975(02)00646-1|title=Undecidable problems in unreliable computations|volume=297|issue=1–3|date = 17 March 2008 |pages ...

==Decision problems== ...lem]] solvable in quadratic time. Kambites & Otto (2006) showed that it is undecidable whether an element of an automatic monoid possesses a right inverse. ...

Some important problems about two-variable logic, such as [[satisfiability (logics)|satisfiability] ...onal complexity theory|computational complexity]] for their satisfiability problems. ...

...is an [[NP-complete]] problem, and is one of the most intensively studied problems in [[computational complexity theory]]. For [[first-order logic]] (FOL), satisfiability is [[undecidable problem|undecidable]]. More specifically, it is a [[RE_(complexity)#co-RE-complete|co-RE-compl ...

...utational complexity theory]] that studies the complexity of computational problems on "most inputs". ...ic case complexity is because for a wide variety of concrete computational problems, the most difficult instances seem to be rare. Typical instances are relati ...

...s with constraints from linear integer arithmetic is [[Undecidable problem|undecidable]].<ref>{{Cite journal |last1=Cox |first1=Jim |last2=McAloon |first2=Ken |la Constrained Horn clauses are a convenient language in which to specify problems in program verification.<ref>{{Citation |last1=Bjørner |first1=Nikolaj |tit ...

...tle=The Undecidable – Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions |title=On undecidable propositions of formal mathematical systems ...

...ften preferred to MTL because some problems that are [[Undecidable problem|undecidable]] for MTL become [[Decidable problem|decidable]] for MITL. === Problems that MITL avoids === ...

...'M'') is the [[Heegaard genus]] of ''M''.<ref>Friedhelm Waldhausen. ''Some problems on 3-manifolds.'' Algebraic and geometric topology (Proc. Sympos. Pure Math ...the rank of that group. The rank problem is one of the harder algorithmic problems studied in group theory and relatively little is known about it. Known resu ...

The Lagrangian can be useful in analyzing extremal problems. The quantity is defined to be ...eal constants, and <math>\{H_{i}\}_{i=1}^{n}</math> graphs. Then, it is an undecidable problem to determine whether the homomorphism density inequality ...

| image = Polyominoes Puzzles Patterns Problems and Packings book cover.png '''''Polyominoes: Puzzles, Patterns, Problems, and Packings''''' is a mathematics book on [[polyomino]]es, the shapes for ...

===Considered problems=== ...Jr.|Markov]] studied this problem and determined it [[undecidable problem|undecidable]], meaning that there is no possible algorithm that can answer the question ...

...it moreover can bring interesting insight in engineering and mathematical problems. ...

== Problems and their complexity == The [[computational complexity]] of some problems related to timed automata are now given. ...

...difference is that Diophantine equations have an [[Hilbert's tenth problem|undecidable solubility problem]],<ref>{{Cite book |last1=Cooper |first1=S. Barry |date= ...e an intermediary step between Hilbert's Tenth Problem and the undecidable problems relating to [[Turing machine]]s.[[File:Маканин Г.С..jpg|thumb|211x211px|[[G ...