H_TM is reduced to HALT_TM and as such, HALT_TM is undecidable.
<h3>How to Interpret Machine Language?</h3>
A language is referred to as Decidable or Recursive if there is a Turing machine that accepts and halts on every input string w. This tells us that every decidable language is Turing-Acceptable.
Now, we are told that the halting language is reducible to some language B. This means that it is an undecidability via reduction.
Now, Using the idea that “ If A is undecidable and reducible to B, then B is undecidable.” Suppose R decides HALT_TM, we will construct S to decide ATM .
S = “On input (M, B)
This means that H_TM is reduced to HALT_TM and as such, HALT_TM is undecidable.
Read more about machine language at; brainly.com/question/28026656
#SPJ1
Answer:
Initial costs 750 and loses .28 of value each year, so still worth 1-.28=.72 of value at start of next year. 750*(.72)^n is the value after n years since for n=0, new, it is 750*.72^0=750*1=750, and after 1 year it is worth 750*.72^1=750*.72 means it lost 28% value after one year. If you with to express it as an exponential exp(..) you need to convert the .72^n into exp(log(.72)*n)=exp(-.3285*n) so you get
750*exp(-.3285*n) as the value after n years.
Answer:
w^2 + 5w = 300
Step-by-step explanation:
A= length x width
A =300
Width = w
length = w + 5
Therefore
300 = (w) x (w + 5)
300 = w^2 + 5w
w^2 + 5w = 300
180 = 2n + 128
2n = 52
n = 26°
180 - 128 = 52
90 + 52 + m = 180
142 + m = 180
m = 38°
Answer: n = 26° and m = 38°
The other ones will be 36, 108, 105, 315.
