Edge Rewrite
everything Source code View original
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a40d0bf58a6f864a

Jump to content

// Workers AI · dad joke modeWhat did NLIN say to its friend? "You're off-line".

Add links
From Wikipedia, the free encyclopedia

In computational complexity theory, NLIN is the class of decision problems that can be solved by a nondeterministic multitape Turing machine in linear time. It is known that this class differs from its deterministic counterpart, DLIN.[1]

References

[edit]
  • Balcázar, Jose Luis; Díaz, Josep; Gabarró, Joaquim (1990). Structural Complexity II. Monographs in Theoretical Computer Science. Vol. 22. Berlin, Heidelberg: Springer. ISBN 3-540-52079-1.
Retrieved from "https://en.wikipedia.org/w/index.php?title=NLIN&oldid=1372297226"