Answer:
function sum(number) {
if (number == 1) {
return 1;
}
return number + sum(number -1);
}
Explanation:
This is a recursive function, it means that is a function that calls itself for example: if you call the function with sum(5) the process is :
sum(5)
|______ 5 + sum(4)
|_______ 4 + sum(3)
|______ 3 + sum(2)
|_____2 + sum(1)
|_____ 1
the result is 1+2+3+4+5 = 15
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
Arch bridges have a semicirclar, curved support.
Answer:
Advantages: computers don't make human error
It can be used for communication
Ease of access
Disadvantages: computers can be a distraction
Potential loss of privacy
It can limit learning and create a dependency
Answer: Triangle
Explanation: Triangle has Tri