Answer:
The answer to this question is given below in the explanation section.
Explanation:
An algorithm is the list of a finite set of instructions and rules that a computer needs to do to complete a task in order to solve a problem.
In short, an algorithm is a series of instructions that are implemented step by step to solve a problem. For example, you could consider a pizza recipe an algorithm for making a pizza in an everyday life routine. But when you are talking about using algorithms in computation and in mathematics. It means that solving a problem using a series of steps step by step.
For example, your everyday tasks aligned on a google calendar and remind you about your tasks using the alarm, etc- how to implement this using set of instructions and rules- is an algorithm.
Solving a quadratic equation is another example of an algorithm.
Binary search, array sorting are an example of an algorithm in computation. Because these algorithms based on the execution of step-by-step instruction to solve a problem such as sorting a list of numbers etc.
Answer:
Dude
Explanation:
Say this again but not in gibberish.
Answer:
<h2>it is a random error </h2>
Explanation:
<h3>I HOPE THAT THIS ANSWER HELPS YOU </h3>
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
