Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

7 relations

Broader (2)

Computability theoryTheory of computation
Friedberg numberingKleene's T predicateKleene's recursion theoremNumbering (computability theory)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Probabilistic (logic) programming concepts
A multitude of different probabilistic programming languages exists today, all extending a traditional programming language with… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Qilin: Exploiting parallelism on heterogeneous multiprocessors with adaptive mapping
Heterogeneous multiprocessors are increasingly important in the multi-core era due to their potential for high performance and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Stable models and an alternative logic programming paradigm
Summary. In this paper we reexamine the place and role of stable model seman­ tics in logic programming and contrast it with a… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A Description of the Model-View-Controller User Interface Paradigm in the Smalltalk-80 System
This essay describes the Model-View-Controller (MVC) programming paradigm and methodology used in the Smalltalk-80TM programming… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Top-Down Induction of Clustering Trees
An approach to clustering is presented that adapts the basic top-down induction of decision trees method towards clustering. To… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Introducing global constraints in CHIP
The purpose of this paper is to show how the introduction of new primitive constraints (e.g., among, diffn, cycle) over finite… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
CHARM++: a portable concurrent object oriented system based on C++
We describe Charm++, an object oriented portable parallel programming language based on C++. Its design philosophy… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Efficient implementation of the smalltalk-80 system
The Smalltalk-80* programming language includes dynamic storage allocation, full upward funargs, and universally polymorphic… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Software Function, Source Lines of Code, and Development Effort Prediction: A Software Science Validation
One of the most important problems faced by software developers and users is the prediction of the size of a programming system… Expand
  • table I
  • table II
  • table IV
  • figure 1
  • table V
Is this relevant?
Highly Cited
1960
Highly Cited
1960
Recursive functions of symbolic expressions and their computation by machine, Part I
A programming system called LISP (for LISt Processor) has been developed for the IBM 704 computer by the Artificial Intelligence… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE