Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Undecidability of restricted uniform recurrence equations

From MaRDI portal
Publication:1901700
Jump to:navigation, search

DOI10.1007/s002360050053zbMath0848.11062OpenAlexW1971232640MaRDI QIDQ1901700

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 (number-theoretic aspects) (11U05) Recurrences (11B37) Decidability of theories and sets of sentences (03B25)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Computability of recurrence equations
  • The mapping of linear recurrence equations on regular arrays
  • The Organization of Computations for Uniform Recurrence Equations


This page was built for publication: Undecidability of restricted uniform recurrence equations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1901700&oldid=14312609"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 13:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki