Negativ numbers no matter how big, will always be less than zero. The correct Answer is A) 45,15,0,-11,-37
Answer:
Type right under my comment
Explanation:
Look in comments
L is a decidable language because the Turing machine accepts it.
L is a recognizable language if TM M recognizes it.
<h3>How do you know if a language is decidable?</h3>
A language is said to be decidable only when there seems to exists a Turing machine that is said to accepts it,
Here, it tends to halts on all inputs, and then it answers "Yes" on words that is seen in the language and says "No" on words that are not found in the language. The same scenario applies to recognizable language.
So, L is a decidable language because the Turing machine accepts it.
L is a recognizable language if TM M recognizes it.
Learn more about programming language from
brainly.com/question/16936315
#SPJ1
The reason for analyzing an algorithm is to discover its characteristics in order to evaluate its suitability for various applications are compared with other algorithms for the same application
