Second-order linear-time computability with applications to computable analysis

DOI10.1007/978-3-030-14812-6_21MaRDI QIDQ2327485zbMATH OpenOpenAlexFDO

Authors Akitoshi Kawamura, Florian Steinberg, Holger Thies

Publication date 15 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-14812-6_21

zbMATH Keywords

computable analysiscomputational complexitylinear time

Mathematics Subject Classification ID

Recommendations

• Small complexity classes for computable analysis
• The basic feasible functionals in computable analysis
• ON THE NOTION OF LINEAR TIME COMPUTABILITY

Cited in

(5)

• scientific article; zbMATH DE number 1114011 (Why is no real title available?)
• Computable analysis and notions of continuity in \textsc{Coq}
• Quantitative continuity and Computable Analysis in Coq
• Computable classifications of continuous, transducer, and regular functions
• Degrees of second- and higher-order polynomials

This page was built for publication: Second-order linear-time computability with applications to computable analysis

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