"40" Result
Sort By:
For the purposes of this monograph, "by a degree" is meant a degree of recursive unsolvability. A degree [script bold]m is said to be minimal if 0 is the unique degree less than [script bold]m. Each of the six chapters of this self-contained monograph is devoted to the proof of …
Theory of Computation -- Mathematical Logic and Formal Languages.
Preface to the fourth edition -- Imperialism of recursive methods -- Overview -- Tools -- Time series -- Dynamic programming -- Practical dynamic programming -- Linear quadratic dynamic programming -- Search and unemployment -- Competitive equilibria and applications -- Recursiv…
