146 search results - page 30 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
SAS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...