Looking for someone who will be available to help with the assignment due in two hours, with the following skills:
Computability: formal languages and problems, Turing Machines (TMs), computability, (semi-)decidability, universal TMs, Church-Turing thesis, halting problem, reduction and undecidability proofs, examples; Complexity: run time, space, complexity classes, non-determinism and NP, polynomial reductions and NP completeness, optimisation problems and approximation, randomisation; Languages and Automata: regular expressions and languages, finite automata, determinisation, context-free grammars and languages (CFLs), Chomsky normal form, word problems, pumping lemma, push-down automata, decidability problems for CFLs. If time permits, also a brief overview of semantics and correctness: while programs, assertions and program correctness, Hoare logic, loops and loop invariants, relative completeness of Hoare logic (and its role in a proof of Gödel's incompleteness result).
Thank you,
Venus
hello
i am a phd in computer science and engineering.
i can do this task perfectly.
i can give you a sample solution(message me for that).
plz provide detail information.
thanks