# Where can I find a Turing machine evaluating arithmetic expressions? [closed]

Is there a Turing machine that can evaluate arithmetic operations with brackets containing +, -, and * operations that are applied to integer numbers?

For example, it should be able to evaluate the following expression given as a sequence of symbols:

7*((3 + 11)*2 -23) + 2*(2 - 4)


I know that such a Turing machine should exists. However, I cannot find any implementation of such a machine.

## closed as off-topic by Andrej Bauer, Hsien-Chih Chang 張顯之, Mohammad Al-Turkistany, Marzio De Biasi, David EppsteinAug 27 '16 at 0:05

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – Andrej Bauer, Hsien-Chih Chang 張顯之, Mohammad Al-Turkistany, Marzio De Biasi, David Eppstein
If this question can be reworded to fit the rules in the help center, please edit the question.

• This question is not research-level and fits better on cs.stackexchange.com. – Andrej Bauer Aug 25 '16 at 15:45