Definition
Not all problems are solvable using computational methods. A problem must be computable, meaning it can be resolved using a well-defined algorithm within a finite and practical amount of time.
Characteristics of Computable Problems
Key Point
| Computability feature | Why it matters |
|---|---|
| Clear inputs/outputs | Problem can be formally specified |
| Well-defined steps | Algorithm can be implemented consistently |
| Finite execution | Solution terminates in practice |
| Deterministic outcome | Same input gives predictable result |
| Practical limitation | Typical constraint |
|---|---|
| Processing power | CPU limits on large/complex tasks |
| Memory | Insufficient RAM/storage for data/structures |
| Time | Runtime too long to be useful |
| Data availability | Missing/poor-quality input data |