Learn More
A new identification type close to tile identification of minimal GSdel numbers is considered. The type is defined by allowing as inplrt both the graph of the target function and an arbitrary upper bound of the minimal index of the target function in a GSdel numbering of all partial recursive functions. However, the result of the inference has to be bounded(More)
  • 1