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

Numbering (computability theory)

Known as: Total numbering, Comparision of numberings, Effective numbering 
In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We use experimental markets to examine whether providing consulting services to a non‐audit client impacts audit quality. Our… Expand
Is this relevant?
2016
2016
Knowledge Management portal is a system to support Knowledge Management process, in order to create, capture, develop, share… Expand
  • figure 1
  • table II
  • table I
  • table III
  • table VI
Is this relevant?
2015
2015
The paper deals with the standardisation and regulatory context of Machine-to-Machine communications and the changes they cause… Expand
  • figure 1
  • figure 2
Is this relevant?
2011
2011
Global Navigation Satellite Systems (GNSSs) use internal reference time scales: GPS Time, GLONASS Time, Galileo System Time and… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
Is this relevant?
2005
2005
This paper presents a method for optimal placement of reclosers and sectionalizers in overhead distribution networks to reduce… Expand
  • table I
  • table II
  • table III
  • table IV
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This article proposes an empirical method to evaluate decentralized economic development programmes with heterogeneous… Expand
  • table 1
  • table 2
  • table 4
  • table 5
  • table 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • J. Mouritsena, H. T. Larsena, P. N. D. Bukhb
  • 2001
  • Corpus ID: 53706043
Intellectual capital statements are ‘new’ forms of reporting whose object is knowledge management activities. Based on 17 firms… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • Y. Ershov
  • Handbook of Computability Theory
  • 1999
  • Corpus ID: 120241616
This chapter introduces the problems of the theory of numberings, a developing branch of the algorithm theory. In the theory of… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We are given a two-dimensional square grid of size N×N, where N∶=2n and n≥0. A space filling curve (SFC) is a numbering of the… Expand
  • figure I
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We are given a two-dimensional square grid of size N×N, where N∶=2n and n≥0. A space filling curve (SFC) is a numbering of the… Expand
Is this relevant?