Entire functions with undecidable arithmetic properties (Q2660319)
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: Entire functions with undecidable arithmetic properties |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Entire functions with undecidable arithmetic properties |
scientific article |
Statements
Entire functions with undecidable arithmetic properties (English)
0 references
29 March 2021
0 references
The main result of this paper is that there exist entire functions \(f(z), g(z), h(z)\in\mathbb Q[[z]]\) with computable coefficients for which the following decision problems are undecidable: 1. Input: An integer \(n\geq 0\). Question: Is \(f(n)\in\mathbb Q\)? 2. Input: An integer \(n\geq 0\). Question: Is \(g^{(n)}(1)\in\mathbb Q\)? 3. Input: An integer \(n\geq 0\). Question: Is \(\int_0^1 h(z) z^n dz\in\mathbb Q\)?
0 references
irrational numbers
0 references
decision problems
0 references
algorithms
0 references
entire function
0 references
arithmetic property
0 references
