No label defined (Q3973745)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 17050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 17050 |
Statements
26 June 1992
0 references
formal language
0 references
Towers of Hanoi problem
0 references
complexity
0 references
Gray code
0 references
0.6719300150871277
0 references
0.64783775806427
0 references
0.6444997191429138
0 references
[For the entire collection see Zbl 0722.00014.] A formal language is defined, including rules for constructing arithmetic expressions using ten digits and three operators. The author then attacks the problem of counting the number of grammatically correct expressions containing \(n\) basis symbols. The Towers of Hanoi problem illustrates the complexity of algorithms. An \(n\)-bit code with \(2^ n\) words is called a Gray code if one gets from one word to the next by changing exactly one bit. The author discusses Gray codes and applies them in particular of humanizing the algorithm for the Towers of Hanoi.
0 references
