2011/08/16 by William Gasarch, Gasarch, William
Computer Science · #03F35 #05D10 #68N30 #Algorithms and Data Compression #B.7.2 #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Parallel Computing and Optimization Techniques
paper · pdf · doi:10.48550/arxiv.1108.3347
openalex publication_date 2011/08/16 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28
Many programs allow the user to input data several times during its\nexecution. If the program runs forever the user may input data infinitely\noften. A program terminates if it terminates no matter what the user does.\n We discuss various ways to prove that program terminates. The proofs use well\norderings, Ramsey Theory, and Matrices. These techniques are used by real\nprogram checkers.\n