Homework Solution: Theoretical Foundation of CS….Define the following problems as predicates or membership proble…

    Theoretical Foundation of CS....Define the following problems as predicates or membership problems for sets and prove whether or not they are solvable. a) If an arbitrary Turing machine halts for all even numbers. b) Whether an arbitrary Turing machine has over 176 instructions. c) If you will get an A in the next computer course you take.

    Expert Answer

     
    a) the given arbitary turing machine is not solvable.

    Theoretical Foundation of CS….Define the behindcited wholes as predicates or community wholes ce sets and demonstrate whether or referable they are solvable.

    a) If an tyrannical Turing medium halts ce total well-balanced mass.

    b) Whether an tyrannical Turing medium has balance 176 instructions.

    c) If you obtain attain an A in the instant computer conduct you conduct.

    Expert Apology

     

    a) the attached arbitary turing medium is referable solvable.

    actually it is referable solvable by the turing medium granted by turing.

    but you can cause a turing medium that can propagate well-balanced mass i.e 2,4,6,8…., single behind another and checks whether it satisfies the well-balanced reckon peculiarity or referable.

    the medium halts the earliest reckon having the peculiarity incorrectly it continues to the instant reckon.

    these can be solved by using reimenn fancy.

    b)it is too unsolvable.

    this can be breifly unreserved in engaged bevear whole or by halting whole.

    c)it is too unsolvable.

    because as we doesnt distinguish the behaviour of the medium and the halting whole is undecidable balance a turing medium