Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)

DOI10.4230/LIPIcs.STACS.2013.514zbMath1354.68076OpenAlexW2244561658MaRDI QIDQ2957912

Amir M. Ben-Amram

Publication date: 30 January 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/stacs/stacs2013.html#Ben-Amram13

zbMATH Keywords

discrete-time dynamical systems termination Collatz problem

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (6)

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems ⋮ On the complexity of bounded time and precision reachability for piecewise affine systems ⋮ On the decidability and complexity of problems for restricted hierarchical hybrid systems ⋮ Mortality and Edge-to-Edge Reachability are Decidable on Surfaces ⋮ Unnamed Item ⋮ A Survey on Analog Models of Computation

This page was built for publication: Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)