Find link

language:

Find link is a tool written by Edward Betts.

searching for Multitape Turing machine 6 found (32 total)

alternate case: multitape Turing machine

NLIN (62 words) [view diff] exact match in snippet view article find links to article

of decision problems that can be solved by a nondeterministic multitape Turing machine in linear time, O(n). It is known that this class differs from

Arnold Schönhage (298 words) [view diff] exact match in snippet view article find links to article

implemented together with Andreas F. W. Grotefeld and Ekkehart Vetter a multitape Turing machine, called TP, in software. The machine is programmed in TPAL, an

List of complexity classes (176 words) [view diff] exact match in snippet view article find links to article

The hardest problems in co-NP DLIN Solvable by a deterministic multitape Turing machine in time O(n). DSPACE(f(n)) Solvable by a deterministic machine

Zvi Galil (2,080 words) [view diff] case mismatch in snippet view article find links to article

Galil, Zvi (1978-04-01). "Palindrome recognition in real time by a multitape turing machine". Journal of Computer and System Sciences. 16 (2): 140–157. doi:10

Factorial (8,432 words) [view diff] exact match in snippet view article find links to article

Performance", pp. 655–656. Schönhage, Arnold (1994). Fast algorithms: a multitape Turing machine implementation. B.I. Wissenschaftsverlag. p. 226. Guy 2004. "B43:

P versus NP problem (7,784 words) [view diff] exact match in snippet view article find links to article

Nerode, Cornell University When one substitutes "linear time on a multitape Turing machine" for "polynomial time" in the definitions of P and NP, one obtains