FAQ

Admissible numbering

Known as: Programming system, Rogers equivalence theorem, Acceptable numbering 
In computability theory, the admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2017
0246819722017

Related topics

Related topics

7 relations
Computability theoryFriedberg numberingKleene's T predicateKleene's recursion theorem
(More)

Broader (1)

Theory of computation

Related mentions per year

Related mentions per year

1940-2018
19401960198020002020
Admissible numbering
Numbering
Theory of computation
Computability theory
Kleene's T predicate
Rice's theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
The YAP Prolog system
Yet Another Prolog (YAP) is a Prolog system originally developed in the mid-eighties and that has been under almost constant… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
Answer Set Solving with Lazy Nogood Generation
Although Answer Set Programming (ASP) systems are highly optimised, their performance is sensitive to the size of the input and… (More)
  • table 1
Is this relevant?
2010
2010
Runtime Verification with the RV System
The RV system is the first system to merge the benefits of Runtime Monitoring with Predictive Analysis. The Runtime Monitoring… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one
It is possible to argue that online bin packing heuristics should be evaluated by using metrics based on their performance over… (More)
  • table 1
  • figure 2
  • table 2
  • table 3
  • table 4
Is this relevant?
2005
2005
Evolving Recursive Programs by Using Adaptive Grammar Based Genetic Programming
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum… (More)
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Forwarding in Attribute Grammars for Modular Language Design
Forwarding is a technique for providing default attribute definitions in attribute grammars that is helpful in the modular… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Generative programming - principles and techniques of software engineering based on automated configuration and fragment-based component models
Current object-oriented (OO) and component technologies suffer from several problems such as the lack of analysis and design… (More)
  • figure 120
  • figure 140
  • table 48
  • table 101
  • figure 4
Is this relevant?
1998
1998
Methods to Evolve Legal Phenotypes
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Type Oriented Logic Meta Programming for Java
This paper presents Type-Oriented Logic Meta Programming. The idea is based on a representation of programs as sets of logic… (More)
  • figure 4
  • figure 5
  • figure 6
  • figure 8
  • figure 10
Is this relevant?