Triple

Target entity: Theory of Recursive Functions and Effective Computability
Context triple: [Barkley Rosser, notableWork, Theory of Recursive Functions and Effective Computability]

• A. Computability and Unsolvability
  Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
• B. On Computable Numbers with an Application to the Entscheidungsproblem
  "On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
• C. Computing with Register Machines
  "Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
• D. Introduction to Metamathematics
  Introduction to Metamathematics is a classic 1952 textbook by Stephen Kleene that systematically develops the foundations of mathematical logic and recursion theory.
• E. Outline of a Mathematical Theory of Computation
  Outline of a Mathematical Theory of Computation is a foundational work by Dana Scott that helped establish the theoretical underpinnings of computer science through the development of denotational semantics and domain theory.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Theory of Recursive Functions and Effective Computability
Target entity description: Theory of Recursive Functions and Effective Computability is a foundational 1957 textbook that systematically develops the theory of computable functions and formalizes the mathematical notion of effective computability.

• A. Computability and Unsolvability
  Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
• B. On Computable Numbers with an Application to the Entscheidungsproblem
  "On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
• C. Computing with Register Machines
  "Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
• D. Introduction to Metamathematics
  Introduction to Metamathematics is a classic 1952 textbook by Stephen Kleene that systematically develops the foundations of mathematical logic and recursion theory.
• E. Outline of a Mathematical Theory of Computation
  Outline of a Mathematical Theory of Computation is a foundational work by Dana Scott that helped establish the theoretical underpinnings of computer science through the development of denotational semantics and domain theory.
• F. None of above. chosen