Need help with small homework assignment on Turing Machines for Computation Theory.
1. Give complete sets of transitions for the following Turing Machines:
[url removed, login to view] Turing machine that computes the function:
f(k) = k+1. Give the complete set of Transistions.
3.)Let L1, L2 be decidable languages. Let M1, M2 be Turing Machines computing their characteristic functions. Prove or disprove:
a)(L1 Union L2) is decidable
b)(L1 Intersection L2) is decidable
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).