Termination of real linear loops

DOI10.1007/978-3-032-31348-5_29MaRDI QIDQ7411984zbMATH OpenFDO

Authors Eike Neumann, Margret Tembo

Publication date 2027

Full work available at URL https://doi.org/10.1007/978-3-032-31348-5_29

zbMATH Keywords

automated verificationcomputable analysisdynamical systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algorithms in real algebraic geometry
• Computability in linear algebra
• Computability on subsets of metric spaces.
• Computable analysis with applications to dynamic systems
• Extended admissibility.
• Handbook of computability and complexity in analysis
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1969324 (Why is no real title available?)
• scientific article; zbMATH DE number 3349776 (Why is no real title available?)
• On the positivity set of a linear recurrence sequence
• On the topological aspects of the theory of represented spaces

This page was built for publication: Termination of real linear loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411984)