ALL (complexity)
In computability and complexity theory, ALL is the class of all decision problems.
Relations to other classes
ALL contains all of the complex classes of decision problems, including RE and co-RE.
gollark: Automatically.
gollark: Even if Discord somehow managed to block selfbots, which I don't think they can do in practice, it would be possible to do something ridiculous like... run Discord in one of those headless browser things, and read out messages and whatnot.
gollark: I think trying to restrict this information from spreading around is... about as effective as DRM, really, for the reason that you can kind of control who gets information but not how it's used or spread out after they do.
gollark: Bots running on a user account instead of a bot one.
gollark: Not technically, they are explicitly.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.