Undecidability of restricted uniform recurrence equations

DOI10.1007/S002360050053MaRDI QIDQ1901700zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

undecidabilitycomputabilitysystem of recurrence equations

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recurrences (11B37) Decidability (number-theoretic aspects) (11U05)

Recommendations

• Computability of recurrence equations
• On the Computational Completeness of Equations over Sets of Natural Numbers
• New results on computability of recurrence equations
• Computability of affine non-conditional recurrent systems
• An undecidable nested recurrence relation

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Computability of recurrence equations
• The Organization of Computations for Uniform Recurrence Equations
• The mapping of linear recurrence equations on regular arrays

Cited in

(8)

• Decidability of uniform recurrence of morphic sequences
• Undecidable arithmetic properties of solutions of Fredholm integral equations
• Computations of uniform recurrence equations using minimal memory size
• An undecidable nested recurrence relation
• Computability of recurrence equations
• Computability of affine non-conditional recurrent systems
• Impossibility of finite generation of partial recursive functions by a unary isotone operation
• New results on computability of recurrence equations

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)