Tractables: Difference between revisions
From Rest of What I Know
Added page description via AutoDescriptor bot |
feasible |
||
| Line 1: | Line 1: | ||
[[Tractables]] are problems that are | [[Tractables]] are problems that are both possible and feasible 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 | Likewise, intractables are problems that are either impossible to solve or possible but not practicable. | ||
== See Also == | == See Also == | ||
Latest revision as of 12:10, 24 January 2026
Tractables are problems that are both possible and feasible 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 either impossible to solve or possible but not practicable.
