Solved

# Theory of computation: computable/non computable problems - does a string x belong to a langage L?

Posted on 2007-03-18

This is a question about the theory of computation.

While I understand that EE probably does not cater to such questions, I will still post it here cos EE has been one of my favorite places to seek online answers to my questions.

The question:

Solving any computational problem can be reduced to/expressed as answering the question "does the string x belong to the language L"? where x and L can be described as required.

(have I written the above accurately?)

I can understand how this applies to a lot of computational problems.

I want to know how this would apply to the following computable problem of the following kind

2*3 = ?