نتایج جستجو برای: extended fuzzy turing machine
تعداد نتایج: 565791 فیلتر نتایج به سال:
By using of analytical multi-logic expresses in conjunction with non-deterministic Turing machine the proposition was proved that algorithm of deterministic Turing counter machine of polynomial time complexity can be decreased to the algorithm of linear time complexity in non-deterministic Turing counter machine. Furthermore, it was shown that existence of reduction of polynomial time complexit...
Ohya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine by rewriting usual quantum Turing machine in terms of channel transformation. Moreover, we define some computational classes of generalized quantum Turing machine and show that we can t...
We construct a two-dimensional Turing machine that is physically universal in both the moving tape and head model. In particular, it mixing of all finite orders models. also provide variant model, but not
Even Alan Turing himself thought about a machine that could break the barrier that had been set by the Church-Turing Thesis resting upon his concept of an universal Turing machine. His Omachine enhances a conventional Turing machine by adding an oracle in a black box. In addition to the normal operations of a Turing machine, this machine can ask the oracle questions (depending on the current st...
Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite (∗-finite) number of bits while keeping the finite combinatoric structures of the classical Turing machines. We will show the following. The internal deterministic Turing machines can do in ∗-polynomial time what a cla...
Using nonstandard analysis, we will extend the classical Turing machines into the internal Turing machines. The internal Turing machines have the capability to work with infinite (∗-finite) number of bits while keeping the finite combinatoric structures of the classical Turing machines. We will show the following. The internal deterministic Turing machines can do in ∗-polynomial time what a cla...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید