All Questions
2 questions
34
votes
9
answers
6k
views
Decision problems for which it is unknown whether they are decidable
In computability theory, what are examples of decision problems of which it is not known whether they are decidable?
15
votes
10
answers
2k
views
Can you prove equivalence without being able to calculate it?
In mathematics we often seek to classify objects up to an equivalence relation, where two objects A and B are said to be equivalent if there exists a map $f:A\rightarrow B$ satisfying certain ...