Liouville numbers and the computational complexity of changing bases (Q2106591)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Liouville numbers and the computational complexity of changing bases |
scientific article; zbMATH DE number 7633496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Liouville numbers and the computational complexity of changing bases |
scientific article; zbMATH DE number 7633496 |
Statements
Liouville numbers and the computational complexity of changing bases (English)
0 references
16 December 2022
0 references
computability
0 references
computational complexity
0 references
Diophantine approximation
0 references
number theory
0 references
0.7679939270019531
0 references
0.7579086422920227
0 references
0.7543732523918152
0 references
0.7496837973594666
0 references
0.7496591806411743
0 references
