1967/01/01 by Albert R. Meyer, Dennis M. Ritchie · 3 citations
Computer Science · #Computability, Logic, AI Algorithms #Logic, programming, and type systems
paper · pdf · doi:10.1145/800196.806014
openalex publication_date 1967/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
Anyone familiar with the theory of computability will be aware that practical conclusions from the theory must be drawn with caution. If a problem can theoretically be solved by computation, this does not mean that it is practical to do so. Conversely, if a problem is formally undecidable, this does not mean that the subcases of primary interest are impervious to solution by algorithmic methods.