Checkables: Difference between revisions
From Rest of What I Know
No edit summary |
Added page description via AutoDescriptor bot |
||
| Line 4: | Line 4: | ||
[[Tractables]] | [[Tractables]] | ||
{{#seo:|description=The Checkables page on this wiki explains the concept of easily verifiable things, an idea related to complexity theory in computer science.}} | |||
[[Category:Concepts]] | [[Category:Concepts]] | ||
Latest revision as of 05:56, 15 December 2025
Checkables are things that are easy to verify. In Computer Science, the rigorous idea is the class of problems in NP. But normal English makes this wordy.
