Identifying nearly minimal Gödel numbers from additional information

No abstract is available for this paper.

• Publication year

  1994

• Venue

  Annals of Mathematics and Artificial Intelligence

• Publication date

  1994-10-10

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1018920425684
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Infinite Class of Functions Identifiable Using Minimal Programs in all Kolmogorov Numberings

  1995cited by this paper
• Inductive Inference of Recursive Functions: Qualitative Theory

  1991cited by this paper
• Inductive Inference with Additional Information

  1979cited by this paper
• An investigation of the relationship between public relations activities and budget allocation in public libraries

  1979cited by this paper
• Limes-Erkennung rekursiver Funktionen durch spezielle Strategien

  1975influential reference
• Optimal enumerations and optimal gödel numberings

  1974cited by this paper
• Theory of Recursive Functions and Effective Computability

  1969cited by this paper
• Three approaches to the quantitative definition of information

  1968cited by this paper
• A Machine-Independent Theory of the Complexity of Recursive Functions

  1967cited by this paper
• Limiting recursion

  1965influential reference
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

  1958cited by this paper

• Learning recursive functions: A survey

  2008cites this paper
• Learning Recursive Functions by Thomas Zeugmann and Sandra Zilles Division of Computer Science Report Series A November

  2007cites this paper