I am learning computability theory. I am just interested to know some famous problems (Formally languages) whose decidability is in question.
Hilbert's Tenth Problem over the rationals is neither known to be decidable nor undecidable: given a set of polynomial equations with rational coefficients, does it have a rational solution? (The same problem with rationals replaced by integers was famously proved undecidable by Matiyasevich, building on M. Davis, H. Putnam, and J. Robinson. See this nice, brief survey by Bjorn Poonen.)