Category talk:Total
Jump to navigation
Jump to search
Self-interpreters of total languages
While it's true that primitive recursive functions are total, and it's true that a function that can simulate any primitive recursive function cannot itself be primitive recursive, it doesn't follow that no total language has a self-interpreter. As a counterexample, System F-omega is total, but it has a self-interpreter. --Chris Pressey (talk) 07:56, 18 June 2020 (UTC)
Refactoring with complexity classes
As the wiki becomes more aware of complexity classes, shouldn't we break this up into better subcategories? Certainly it shouldn't be a subcategory of category:concepts. Corbin (talk) 16:12, 28 September 2021 (UTC)