Undecidability of restricted uniform recurrence equations
From MaRDI portal
Publication:1901700
DOI10.1007/S002360050053zbMATH Open0848.11062OpenAlexW1971232640MaRDI QIDQ1901700FDOQ1901700
Authors: Egon Wanke
Publication date: 19 November 1995
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050053
Recommendations
Decidability of theories and sets of sentences (03B25) Recurrences (11B37) Decidability (number-theoretic aspects) (11U05)
Cites Work
Cited In (8)
- Computability of recurrence equations
- Computability of affine non-conditional recurrent systems
- Impossibility of finite generation of partial recursive functions by a unary isotone operation
- Undecidable arithmetic properties of solutions of Fredholm integral equations
- An undecidable nested recurrence relation
- New results on computability of recurrence equations
- Computations of uniform recurrence equations using minimal memory size
- Decidability of uniform recurrence of morphic sequences
This page was built for publication: Undecidability of restricted uniform recurrence equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901700)