Abstract :
The existence of one-way functions is a question that has not yet been answered. If we solve the problem P versus UP showing that both classes are different, then it would result in fact there are strong one-way functions and thus P is not equal to NP. In this work we showed that some kinds of unambiguous Turing machines can not be converted into deterministic, because it will imply that some Turing machines which do not halt for some inputs could be decided in polynomial time by certain deterministic Turing machines. But, is impossible that we can decide in polynomial time over a deterministic Turing machine if any deterministic Turing machine does not halt in polynomial time. Therefore by the rule of reduction ad absurdum we have that P and UP are different.
Keywords :
Turing machines; computational complexity; deterministic algorithms; P problem; UP problem; complexity classes; deterministic turing machines; one-way functions; polynomial time; Abstracts; Complexity theory; Computational modeling; Polynomials; Silicon; Silicon compounds; Turing machines; Complexity classes; One-way functions; Turing machines;
