Key Points and Importance of Solvability

Question

Language solvable If TM recognizes the language and enters the Accept or Reject state. As a developer. I think this is important because it means that we can determine if the program contains buffer overflows or deadlocks. In addition, the following problems are not resolved:

• Does the program provide access to an uninitialized variable.
• Two contextual free grammars describe the same langauge.
• Does it matter if the parameters for the subroutine are passed by reference or by copy result

In terms of Decidability, what would you say are key points for Decidability and why Decidability is important (especially for the developer).

Note. Bullet points in the answers - I can see the topics myself. I just want to know what the main points are.

Answer 1

Maybe this refers to the cstheory exchange , but I will go anyway.

Key point: some problems are unsolvable, that is, they are not solved by the algorithm, so they should be solved by other methods. Among these problems, there are many “meta-problems” in relation to computer languages, for example , the virus detection problem .

Having determined that the problem is insoluble, there are several possible methods of action:

• , .. -, , . - no answer, .
• , , , .
• 2 + , .
• , .
• , , .

1 3 , . 4 - , . 5 - , ; , JavaScript/Scheme/Lua/whatever, , /.

Answer 2

, - , : " ".

, , , - : " , ".

, , .

, , .

, , .