Tractables: Difference between revisions

From Rest of What I Know
Created page with "Tractables are problems that are easy to solve. In Computer Science, this would be problems in P. Programmers and the like do use 'tractable' to describe non-programming straightforward-to-solve things, so this is not unusual. == See Also == Checkables Category:Concepts"
 
Added page description via AutoDescriptor bot
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
[[Tractables]] are problems that are easy to solve. In Computer Science, this would be problems in P. Programmers and the like do use 'tractable' to describe non-programming straightforward-to-solve things, so this is not unusual.
[[Tractables]] are problems that are easy to solve. In Computer Science, this would be problems in P. Programmers and the like do use 'tractable' to describe non-programming straightforward-to-solve things, so this is not unusual.
Likewise, intractables are problems that are hard to solve.


== See Also ==
== See Also ==


[[Checkables]]
[[Checkables]]
{{#seo:|description=The wiki page on Tractables provides a concise overview of problems that are easy to solve, contrasting them with more complex, intractable issues.}}


[[Category:Concepts]]
[[Category:Concepts]]

Latest revision as of 05:56, 15 December 2025

Tractables are problems that are easy to solve. In Computer Science, this would be problems in P. Programmers and the like do use 'tractable' to describe non-programming straightforward-to-solve things, so this is not unusual.

Likewise, intractables are problems that are hard to solve.

See Also[edit]

Checkables