scientific article; zbMATH DE number 7407788
From MaRDI portal
Publication:5155677
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/2008.00583
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computability in linear algebra
- On the positivity set of a linear recurrence sequence
- Theory of representations
- Occurrence of zero in a linear recursive sequence
- Properly injective spaces and function spaces
- Computability on subsets of metric spaces.
- Extended admissibility.
- Comparing representations for function spaces in computable analysis
- Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
- Deux propriétés décidables des suites récurrentes linéaires
- Overt choice
- On the Positivity Problem for Simple Linear Recurrence Sequences,
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
- Positivity Problems for Low-Order Linear Recurrence Sequences
- Computer Science Logic
- On the topological aspects of the theory of represented spaces
- Algorithms in real algebraic geometry
