scientific article; zbMATH DE number 6691416

DOI10.4230/LIPICS.STACS.2014.362MaRDI QIDQ2965498zbMATH OpenFDO

Authors Mathieu Hoyrup

Publication date 3 March 2017

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2014.362

zbMATH Keywords

computability theorycomputable analysisfinite injurygeneric set

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Constructive and recursive analysis (03F60)

Recommendations

• Reversible Turing Machines and Polynomial Time Reversibly Computable Functions
• From reversible to irreversible computations
• On non-computable functions
• Irrational-based computability of functions
• On reversible Turing machines and their function universality
• Publication:4207514
• Computability and the Implicit Function Theorem
• scientific article; zbMATH DE number 4055607
• Reversible and irreversible computations of deterministic finite-state devices
• A class of reversible primitive recursive functions

Cited in

(8)

• Computable invariance
• Genericity of weakly computable objects
• Realizing semicomputable simplices by computable dynamical systems
• The typical constructible object
• scientific article; zbMATH DE number 1088268 (Why is no real title available?)
• Computable Measure Theory and Algorithmic Randomness
• Comparing computability in two topologies
• Complexity of inversion of functions on the reals

This page was built for publication:

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