Surface roughness: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>BenFrantzDale
Added to intro, mention Surface Roughness Comparators
 
en>BG19bot
m →‎Profile roughness parameters: WP:CHECKWIKI error fix for #61. Punctuation goes before References. Do general fixes if a problem exists. - using AWB (9863)
Line 1: Line 1:
I am Oscar and I completely dig that title. Bookkeeping is her day occupation now. What I love performing is doing ceramics but I haven't produced a dime with it. California is where I've always been residing and I adore each day residing right here.<br><br>my web blog; [http://muzikoman.com/profile-682/info/ muzikoman.com]
{{numeral systems}}
 
'''Bijective numeration''' is any [[numeral system]] in which every non-negative [[integer]] can be represented in exactly one way using a finite string of digits. The name derives from this [[bijection]] (one-to-one correspondence) between the set of non-negative integers and the set of finite strings using a finite set of symbols (the "digits").
 
A '''bijective [[radix|base-''k'']] numeration''' is a bijective [[positional notation]]. It uses a string of digits from the set {1, 2, ..., ''k''} (where ''k'' ≥ 1) to encode each positive integer; a digit's position in the string defines its value as a multiple of a power of ''k''. Bijective base-''k'' numeration is also called ''k''-adic notation, not to be confused with the [[p-adic number|''p''-adic number system]].
 
Most ordinary numeral systems, such as the common [[decimal]] system, are not bijective because more than one string of digits can represent the same positive integer. In particular, adding [[leading zero]]es does not change the value represented, so "1", "01" and "001" all represent the number [[1 (number)|one]]. Even though only the first is usual, the fact that the others are possible means that decimal is not bijective. However, [[unary numeral system|unary]], with only one digit, ''is'' bijective.
 
==Definition==
The '''''k''-adic numeration system''' uses the digit-set {1, 2, ..., ''k''} (''k'' ≥ 1) to uniquely represent every non-negative integer, as follows:
 
* The integer zero is represented by the ''empty string''.
 
* The integer represented by the nonempty digit-string
 
::''a''<sub>''n''</sub>''a''<sub>''n''−1</sub> ... ''a''<sub>1</sub>''a''<sub>0</sub>
:is
::''a''<sub>''n''</sub> ''k''<sup>''n''</sup> + ''a''<sub>''n''−1</sub> ''k''<sup>''n''−1</sup> + ... + ''a''<sub>1</sub> ''k''<sup>1</sup> + ''a''<sub>0</sub> ''k''<sup>0</sup>.
 
* The digit-string representing the integer ''m'' &gt; 0 is
::''a''<sub>''n''</sub>''a''<sub>''n''−1</sub> ... ''a''<sub>1</sub>''a''<sub>0</sub>
 
:where
 
::<math>
\begin{align}
a_0 & = & m  - q_0 k , & & q_0 & = & f\left(\frac m  k \right) & \\
a_1 & = & q_0 - q_1 k , & & q_1 & = & f\left(\frac {q_0} k \right) & \\
a_2 & = & q_1 - q_2 k , & & q_2 & = & f\left(\frac {q_1} k \right) & \\
    & \vdots &          & &    & \vdots & & \\
a_n & = & q_{n-1} - 0 k , & & q_n & = & f\left(\frac {q_{n-1}} k \right) & = 0
\end{align}
</math>
:and
 
::<math>f(x) = \lceil x \rceil - 1</math>,
 
:<math>\lceil x \rceil</math> being the least integer not less than ''x'' (the [[ceiling function]]).
 
==Properties of bijective base-''k'' numerals==
 
For a given ''k'' ≥ 1,
 
* there are exactly ''k''<sup>''n''</sup> ''k''-adic numerals of length ''n'' ≥ 0;
 
* if ''k'' &gt; 1, the number of digits in the ''k''-adic numeral representing a nonnegative integer ''n'' is [[Logarithm|<math>\lfloor \log_k (n+1) +\log_k(k - 1) \rfloor</math>]]{{cn|date=April 2013}}, in contrast to [[Floor and ceiling functions#Number of digits|<math>\lfloor \log_k n\rfloor +1 \ (n > 0)</math>]] for ordinary base-k numerals; if ''k'' = 1 (i.e., unary), then the number of digits is just ''n'';
 
* a list of ''k''-adic numerals, in natural order of the integers represented, is automatically in [[shortlex order]] (shortest first, lexicographical within each length). Thus, using ε to denote the empty string, the 1-, 2-, 3-, and 10-adic numerals are as follows (where the ordinary binary and decimal representations are listed for comparison):
 
{| cellpadding="6"
|- align="right"
! 1-adic:
| <tt> ε </tt>
| <tt> 1 </tt> || <tt> 11 </tt> || <tt> 111 </tt>
| <tt> 1111 </tt> || <tt> 11111 </tt> || <tt> ... </tt>
| colspan="11" align="left" |([[unary numeral system]])
|- align="right"
! 2-adic:
| <tt> ε </tt>
| <tt> 1 </tt> || <tt> 2 </tt> || <tt> 11 </tt>
| <tt> 12 </tt>
| <tt> 21 </tt> || <tt> 22 </tt> || <tt> 111 </tt>
| <tt> 112 </tt> || <tt> 121 </tt>
| <tt> 122 </tt> || <tt> 211 </tt> || <tt> 212 </tt>
| <tt> 221 </tt>
| <tt> 222 </tt> || <tt> 1111 </tt> || <tt> 1112 </tt>
| <tt> ... </tt>
|- align="right"
! binary:
| <tt> 0 </tt>
| <tt> 1 </tt> || <tt> 10 </tt> || <tt> 11 </tt>
| <tt> 100 </tt>
| <tt> 101 </tt> || <tt> 110 </tt> || <tt> 111 </tt>
| <tt> 1000 </tt> || <tt> 1001 </tt>
| <tt> 1010 </tt> || <tt> 1011 </tt> || <tt> 1100 </tt>
| <tt> 1101 </tt>
| <tt> 1110 </tt> || <tt> 1111 </tt> || <tt> 10000 </tt>
| <tt> ... </tt>
|- align="right"
! 3-adic:
| <tt> ε </tt>
| <tt> 1 </tt> || <tt> 2 </tt> || <tt> 3 </tt>
| <tt> 11 </tt>
| <tt> 12 </tt> || <tt> 13 </tt> || <tt> 21 </tt>
| <tt> 22 </tt> || <tt> 23 </tt>
| <tt> 31 </tt> || <tt> 32 </tt> || <tt> 33 </tt>
| <tt> 111 </tt>
| <tt> 112 </tt> || <tt> 113 </tt> || <tt> 121 </tt>
| <tt> ... </tt>
|- align="right"
! 10-adic:
| <tt> ε </tt>
| <tt> 1 </tt> || <tt> 2 </tt> || <tt> 3 </tt>
| <tt> 4 </tt>
| <tt> 5 </tt> || <tt> 6 </tt> || <tt> 7 </tt>
| <tt> 8 </tt> || <tt> 9 </tt>
| <tt> A </tt> || <tt> 11 </tt> || <tt> 12 </tt>
| <tt> 13 </tt>
| <tt> 14 </tt> || <tt> 15 </tt> || <tt> 16 </tt>
| <tt> ... </tt>
|- align="right"
! decimal:
| <tt> 0 </tt> || <tt> 1 </tt>
| <tt> 2 </tt> || <tt> 3 </tt>
| <tt> 4 </tt> || <tt> 5 </tt> || <tt> 6 </tt>
| <tt> 7 </tt>
| <tt> 8 </tt> || <tt> 9 </tt> || <tt> 10 </tt>
| <tt> 11 </tt> || <tt> 12 </tt>
| <tt> 13 </tt> || <tt> 14 </tt> || <tt> 15 </tt>
| <tt> 16 </tt> || <tt> ... </tt>
|}
 
==Examples==
 
:(34152)<sub>five-adic</sub> = 3×5<sup>4</sup> + 4×5<sup>3</sup> + 1×5<sup>2</sup> + 5×5<sup>1</sup> + 2×5<sup>0</sup> = (2427)<sub>decimal</sub>.
 
:(119A)<sub>ten-adic</sub> = 1×10<sup>3</sup> + 1×10<sup>2</sup> + 9×10<sup>1</sup> + 10×10<sup>0</sup> = (1200)<sub>decimal</sub>.
 
In the last example, the digit "A" represents the integer ten.  For 10&nbsp;≤&nbsp;''k''&nbsp;≤&nbsp;35, it is common to use successive letters of a common alphabet for the digits after 9; e.g., bijective hexadecimal would use the sixteen digits {1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F, G}.
 
==The bijective base-10 system==
 
The bijective base-10 system is also known as '''decimal without a zero'''. It is a base [[10 (number)|ten]] positional [[numeral system]] that does not use a digit to represent [[0 (number)|zero]]. It instead has a digit to represent ten, such as ''A''.
 
As with conventional [[decimal]], each digit position represents a power of ten, so for example 123 is "one hundred, plus two tens, plus three units."  All [[positive integer]]s which are represented solely with non-zero digits in conventional decimal (such as 123) have the same representation in decimal without a zero. Those that use a zero must be rewritten, so for example 10 becomes A, conventional 20 becomes 1A, conventional 100 becomes 9A, conventional 101 becomes A1, conventional 302 becomes 2A2, conventional 1000 becomes 99A, conventional 1110 becomes AAA, conventional 2010 becomes 19AA, and so on.
 
[[Addition]] and [[multiplication]] in decimal without a zero are essentially the same as with conventional decimal, except that carries occur when a position exceeds ten, rather than when it exceeds nine.  So to calculate 643 + 759, there are twelve units (write 2 at the right and carry 1 to the tens), ten tens (write A with no need to carry to the hundreds), thirteen hundreds (write 3 and carry 1 to the thousands), and one thousand (write 1), to give the result 13A2 rather than the conventional 1402.
 
The [[Greek numerals|system of common numerals]] used in [[ancient Greece]] prior to the [[Hellenistic Age]] was a bijective base-10 number system in which letters of the [[Greek alphabet]] were assigned values between 1 and 900. This was the system used to reckon the year based on the four-year [[Olympiads]], so for instance 480 BCE (the date of the [[Battle of Thermopylae]]) would be written ἔτει αʹ  Ὀλυμπιάδος οδʹ, that is, the 1st year of the 74th Olympiad. These numbers are still commonly used in Greece for [[Ordinal number (linguistics)|ordinals]].
 
==The bijective base-26 system==
{{See also|Hexavigesimal}}
The bijective base-26 system is also known as '''base 26 without a zero'''. It is a base [[26 (number)|twenty-six]] positional [[numeral system]] that does not use a digit to represent [[0 (number)|zero]]. It uses digits "A" to "Z" to represent [[1 (number)|one]] to [[26 (number)|twenty-six]].
 
The number sequence goes A, B, C, ..., X, Y, Z, AA, AB, AC, ..., AX, AY, AZ, BA, BB, BC, ... 
 
Each digit position represents a power of twenty-six, so for example, ABC is "one 26<sup>2</sup>, plus two 26<sup>1</sup>, plus three 26<sup>0</sup>" since A is worth one, B is worth two, and C is worth three.
 
In this representation the number WIKIPEDIA is:
:23×26<sup>8</sup> + 9×26<sup>7</sup> + 11×26<sup>6</sup> + 9×26<sup>5</sup> + 16×26<sup>4</sup> + 5×26<sup>3</sup> + 4×26<sup>2</sup> + 9×26<sup>1</sup> + 1×26<sup>0</sup> = 4,878,821,185,187
 
===Systematic naming using the alphabet===
Many [[spreadsheet]]s including [[Microsoft Excel]] use the 26-adic counting system with the "digits" A-Z to label the columns of a spreadsheet, starting A, B, C, ..., Z, AA, AB, ..., AZ, BA, ..., ZZ, AAA, etc.  The numbering starts at 1 or A, so the empty string is not used.  A variant of this system is used to name [[Variable star designation|variable stars]], it can be applied to any problem where a systematic naming using letters is desired, while using the shortest possible strings.
 
==Historical notes==
 
The fact that every non-negative integer has a unique representation in bijective base-''k'' (''k'' ≥ 1), is a "[[mathematical folklore|folk theorem]]" that has been rediscovered many times.  Early instances are [[James Foster|Foster, J. E.]] (1947), [[Raymond Smullyan|Smullyan]] (1961) for the case ''k'' = 2, and [[Corrado Böhm|Böhm]] (1964) for all ''k'' ≥ 1 (the latter using these representations to perform computations in the programming language [[P prime prime|P′′]]). [[Donald Knuth|Knuth]] (1969) mentions the special case of ''k'' = 10, and [[Arto Salomaa|Salomaa]] (1973) discusses the cases ''k'' ≥ 2.  Forslund (1995) considers that if ancient numeration systems used bijective base-''k'', they might not be recognized as such in archaeological documents, due to general unfamiliarity with this system.  (The latter article is notable in that it does not cite existing literature on this system, but appears to unwittingly reinvent it.)
 
==References==
* [[Corrado Böhm|Böhm, C.]], "On a family of Turing machines and the related programming language", ''ICC Bulletin 3'', p. 191, July 1964.
* [[James Foster|Foster, J. E.]], "A Number System Without a Zero Symbol", ''Mathematics Magazine'', Vol.21, No.1 pp. 39-41, 1947.
* [[Donald Knuth|Knuth, D. E.]], ''[[The Art of Computer Programming]], Vol. 2: Seminumerical Algorithms'', 1st ed., Addison-Wesley, 1969. (Solution to Exercise 4.1-24, p. 495., discusses bijective base-10.)
* [[Arto Salomaa|Salomaa, A.]], ''Formal Languages'', Academic Press, 1973. (Note 9.1, pp. 90-91, discusses bijective base-''k'' for all ''k'' ≥ 2.)
* [[Raymond Smullyan|Smullyan, R.]], "Theory of Formal Systems", ''Annals of Mathematics Studies'', Number 47, Princeton, 1961.
 
==External links==
*[http://www.maths.soton.ac.uk/EMIS/journals/SWJPAM/vol1-95.html Forslund, R. R.: "A logical alternative to the existing positional number system", ''Southwest Journal of Pure and Applied Mathematics'', Volume 1 (September 1995), pp. 27-29.]
 
[[Category:Numeral systems]]
[[Category:Non-standard positional numeral systems]]

Revision as of 08:49, 14 January 2014

When it pertains to hosting leaders, HostGator is clearly a top tier choice. The success HostGator has attained has been unmatched. They are among the world's 10 biggest hosting business. According to their site, they host well over 2,500,000 domains. They have also been ranked number 21 on the Inc 5000 fastest growing business in America. From the years 2005 to 2008, HostGator attained a 900 % boost in income. As you can tell HostGator has actually been very successful. We easily admit here at Web Host Coach, that HostGator places as a top favorite within our team. Now HostGator didn't pay us to say that. Its simply the way it has fallen out. More of us consistently utilize this platform because it just adheres with exactly what we like.
Now lets learn why

Dependability

In order to make the depend on of clients it is essential that you establish reliable hosting services, otherwise your business will tumble. Similar to the various other hosting services we recommend, HostGator has a cutting-edge data center with backup power generators and all of the techno goodies to make her hum. They boast a 99.9 % uptime record. HostGator also went a step further and presented a Gigabit Uplink with a Surefire 20mbit connection. This guarantees that there will be no failures in any network. HostGator has also carried out several layers of network protection making sure the wellness of all your details. We might continue about their technology, however its fair to say that all of the 5 hosting services that satisfied our requirements, stand out in this location. Along with impressive customer support, the reliability of the technology is a green charge to even being thought about for this review.

Rate

In in our book, when it comes to internet hosting, cost is a huge deal. HostGator is probably the closest thing that you will discover to pulling the rabbit out of the hat. HostGator is also well understood for the remarkable endless diskspace and bandwidth they provide.

Control Panel

HostGator uses an exceptionally simple to navigate cPanel. The HostGator cPanel is one of the most individual friendly complete featured control panels. Just click on their link below and you can really demo their cPanel in order to get "feel" for how it runs.

Client service

One of the reasons HostGator has actually been so successful is the reality that they offer quality consumer service. HostGator offers honor winning support 24/7/365. HostGator's purpose it to address any internet hosting problem you have and offer recommendations that can conserve you a lot of time and money.

Summary

Endless disk area
Unrestricted bandwidth
Unlimited domains
Instantaneous backups
99.9 uptime guarantee
WordPress friendly
45 day refund assure
Free setup
24/7 support
$50 cost-free Google AdWords
Website contractor

Conclusion

HostGator has actually proven it is one of the leaders in the internet hosting market. HostGator provides top of the line customer service and dependability. In case you loved this post and you would like to receive details with regards to Hostgator Coupons kindly visit our web-site. It is no error that HostGator is one of the fastest expanding companies in America.

Bijective numeration is any numeral system in which every non-negative integer can be represented in exactly one way using a finite string of digits. The name derives from this bijection (one-to-one correspondence) between the set of non-negative integers and the set of finite strings using a finite set of symbols (the "digits").

A bijective base-k numeration is a bijective positional notation. It uses a string of digits from the set {1, 2, ..., k} (where k ≥ 1) to encode each positive integer; a digit's position in the string defines its value as a multiple of a power of k. Bijective base-k numeration is also called k-adic notation, not to be confused with the p-adic number system.

Most ordinary numeral systems, such as the common decimal system, are not bijective because more than one string of digits can represent the same positive integer. In particular, adding leading zeroes does not change the value represented, so "1", "01" and "001" all represent the number one. Even though only the first is usual, the fact that the others are possible means that decimal is not bijective. However, unary, with only one digit, is bijective.

Definition

The k-adic numeration system uses the digit-set {1, 2, ..., k} (k ≥ 1) to uniquely represent every non-negative integer, as follows:

  • The integer zero is represented by the empty string.
  • The integer represented by the nonempty digit-string
anan−1 ... a1a0
is
an kn + an−1 kn−1 + ... + a1 k1 + a0 k0.
  • The digit-string representing the integer m > 0 is
anan−1 ... a1a0
where
and
,
being the least integer not less than x (the ceiling function).

Properties of bijective base-k numerals

For a given k ≥ 1,

  • there are exactly kn k-adic numerals of length n ≥ 0;
  • a list of k-adic numerals, in natural order of the integers represented, is automatically in shortlex order (shortest first, lexicographical within each length). Thus, using ε to denote the empty string, the 1-, 2-, 3-, and 10-adic numerals are as follows (where the ordinary binary and decimal representations are listed for comparison):
1-adic: ε 1 11 111 1111 11111 ... (unary numeral system)
2-adic: ε 1 2 11 12 21 22 111 112 121 122 211 212 221 222 1111 1112 ...
binary: 0 1 10 11 100 101 110 111 1000 1001 1010 1011 1100 1101 1110 1111 10000 ...
3-adic: ε 1 2 3 11 12 13 21 22 23 31 32 33 111 112 113 121 ...
10-adic: ε 1 2 3 4 5 6 7 8 9 A 11 12 13 14 15 16 ...
decimal: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ...

Examples

(34152)five-adic = 3×54 + 4×53 + 1×52 + 5×51 + 2×50 = (2427)decimal.
(119A)ten-adic = 1×103 + 1×102 + 9×101 + 10×100 = (1200)decimal.

In the last example, the digit "A" represents the integer ten. For 10 ≤ k ≤ 35, it is common to use successive letters of a common alphabet for the digits after 9; e.g., bijective hexadecimal would use the sixteen digits {1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F, G}.

The bijective base-10 system

The bijective base-10 system is also known as decimal without a zero. It is a base ten positional numeral system that does not use a digit to represent zero. It instead has a digit to represent ten, such as A.

As with conventional decimal, each digit position represents a power of ten, so for example 123 is "one hundred, plus two tens, plus three units." All positive integers which are represented solely with non-zero digits in conventional decimal (such as 123) have the same representation in decimal without a zero. Those that use a zero must be rewritten, so for example 10 becomes A, conventional 20 becomes 1A, conventional 100 becomes 9A, conventional 101 becomes A1, conventional 302 becomes 2A2, conventional 1000 becomes 99A, conventional 1110 becomes AAA, conventional 2010 becomes 19AA, and so on.

Addition and multiplication in decimal without a zero are essentially the same as with conventional decimal, except that carries occur when a position exceeds ten, rather than when it exceeds nine. So to calculate 643 + 759, there are twelve units (write 2 at the right and carry 1 to the tens), ten tens (write A with no need to carry to the hundreds), thirteen hundreds (write 3 and carry 1 to the thousands), and one thousand (write 1), to give the result 13A2 rather than the conventional 1402.

The system of common numerals used in ancient Greece prior to the Hellenistic Age was a bijective base-10 number system in which letters of the Greek alphabet were assigned values between 1 and 900. This was the system used to reckon the year based on the four-year Olympiads, so for instance 480 BCE (the date of the Battle of Thermopylae) would be written ἔτει αʹ Ὀλυμπιάδος οδʹ, that is, the 1st year of the 74th Olympiad. These numbers are still commonly used in Greece for ordinals.

The bijective base-26 system

DTZ's public sale group in Singapore auctions all forms of residential, workplace and retail properties, outlets, homes, lodges, boarding homes, industrial buildings and development websites. Auctions are at present held as soon as a month.

We will not only get you a property at a rock-backside price but also in an space that you've got longed for. You simply must chill out back after giving us the accountability. We will assure you 100% satisfaction. Since we now have been working in the Singapore actual property market for a very long time, we know the place you may get the best property at the right price. You will also be extremely benefited by choosing us, as we may even let you know about the precise time to invest in the Singapore actual property market.

The Hexacube is offering new ec launch singapore business property for sale Singapore investors want to contemplate. Residents of the realm will likely appreciate that they'll customize the business area that they wish to purchase as properly. This venture represents one of the crucial expansive buildings offered in Singapore up to now. Many investors will possible want to try how they will customise the property that they do determine to buy by means of here. This location has offered folks the prospect that they should understand extra about how this course of can work as well.

Singapore has been beckoning to traders ever since the value of properties in Singapore started sky rocketing just a few years again. Many businesses have their places of work in Singapore and prefer to own their own workplace area within the country once they decide to have a everlasting office. Rentals in Singapore in the corporate sector can make sense for some time until a business has discovered a agency footing. Finding Commercial Property Singapore takes a variety of time and effort but might be very rewarding in the long term.

is changing into a rising pattern among Singaporeans as the standard of living is increasing over time and more Singaporeans have abundance of capital to invest on properties. Investing in the personal properties in Singapore I would like to applaud you for arising with such a book which covers the secrets and techniques and tips of among the profitable Singapore property buyers. I believe many novice investors will profit quite a bit from studying and making use of some of the tips shared by the gurus." – Woo Chee Hoe Special bonus for consumers of Secrets of Singapore Property Gurus Actually, I can't consider one other resource on the market that teaches you all the points above about Singapore property at such a low value. Can you? Condominium For Sale (D09) – Yong An Park For Lease

In 12 months 2013, c ommercial retails, shoebox residences and mass market properties continued to be the celebrities of the property market. Models are snapped up in report time and at document breaking prices. Builders are having fun with overwhelming demand and patrons need more. We feel that these segments of the property market are booming is a repercussion of the property cooling measures no.6 and no. 7. With additional buyer's stamp responsibility imposed on residential properties, buyers change their focus to commercial and industrial properties. I imagine every property purchasers need their property funding to understand in value. The bijective base-26 system is also known as base 26 without a zero. It is a base twenty-six positional numeral system that does not use a digit to represent zero. It uses digits "A" to "Z" to represent one to twenty-six.

The number sequence goes A, B, C, ..., X, Y, Z, AA, AB, AC, ..., AX, AY, AZ, BA, BB, BC, ...

Each digit position represents a power of twenty-six, so for example, ABC is "one 262, plus two 261, plus three 260" since A is worth one, B is worth two, and C is worth three.

In this representation the number WIKIPEDIA is:

23×268 + 9×267 + 11×266 + 9×265 + 16×264 + 5×263 + 4×262 + 9×261 + 1×260 = 4,878,821,185,187

Systematic naming using the alphabet

Many spreadsheets including Microsoft Excel use the 26-adic counting system with the "digits" A-Z to label the columns of a spreadsheet, starting A, B, C, ..., Z, AA, AB, ..., AZ, BA, ..., ZZ, AAA, etc. The numbering starts at 1 or A, so the empty string is not used. A variant of this system is used to name variable stars, it can be applied to any problem where a systematic naming using letters is desired, while using the shortest possible strings.

Historical notes

The fact that every non-negative integer has a unique representation in bijective base-k (k ≥ 1), is a "folk theorem" that has been rediscovered many times. Early instances are Foster, J. E. (1947), Smullyan (1961) for the case k = 2, and Böhm (1964) for all k ≥ 1 (the latter using these representations to perform computations in the programming language P′′). Knuth (1969) mentions the special case of k = 10, and Salomaa (1973) discusses the cases k ≥ 2. Forslund (1995) considers that if ancient numeration systems used bijective base-k, they might not be recognized as such in archaeological documents, due to general unfamiliarity with this system. (The latter article is notable in that it does not cite existing literature on this system, but appears to unwittingly reinvent it.)

References

  • Böhm, C., "On a family of Turing machines and the related programming language", ICC Bulletin 3, p. 191, July 1964.
  • Foster, J. E., "A Number System Without a Zero Symbol", Mathematics Magazine, Vol.21, No.1 pp. 39-41, 1947.
  • Knuth, D. E., The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 1st ed., Addison-Wesley, 1969. (Solution to Exercise 4.1-24, p. 495., discusses bijective base-10.)
  • Salomaa, A., Formal Languages, Academic Press, 1973. (Note 9.1, pp. 90-91, discusses bijective base-k for all k ≥ 2.)
  • Smullyan, R., "Theory of Formal Systems", Annals of Mathematics Studies, Number 47, Princeton, 1961.

External links