New answers tagged decidability
1
I have concluded that one cannot add both + and × in the λProlog programming language with their arithmetic semantics since the decision problem is undeciable. Because if it was decidable then Hilbert's tenth problem would have a positive answer. See the Wikipedia page for Hilbert's tenth problem.
Top 50 recent answers are included
Related Tags
decidability × 65computability × 19
fl.formal-languages × 11
context-free × 10
undecidability × 9
turing-machines × 8
lo.logic × 6
automata-theory × 6
reference-request × 5
cc.complexity-theory × 4
halting-problem × 4
pl.programming-languages × 3
regular-language × 3
complexity-classes × 2
type-theory × 2
np × 2
nt.number-theory × 2
grammars × 2
oracles × 2
logic-programming × 2
model-theory × 2
enumeration × 2
graph-theory × 1
co.combinatorics × 1
np-hardness × 1