Metastability and higher-order computability

DOI10.1007/978-3-319-72056-2_19zbMATH Open1503.03040OpenAlexW2769220096MaRDI QIDQ1709712FDOQ1709712

Authors: Sam Sanders 

Publication date: 6 April 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-72056-2_19

Recommendations

• Notions of Cauchyness and metastability
• On the extraction of computational content from noneffective convergence proofs in analysis
• Rates of metastability for iterations on the unit interval
• Nonstandard convergence gives bounds on jumps
• Model theory and metric convergence. I: Metastability and dominated convergence model theory and metric convergence

zbMATH Keywords

metastabilitynonstandard analysishigher-order computability

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Nonstandard models in mathematics (03H05)

Cited In (10)

• Computability theory, nonstandard analysis, and their connections
• Nonstandard convergence gives bounds on jumps
• The strength of compactness in computability theory and nonstandard analysis
• Reverse mathematics and parameter-free transfer
• Model theory and metric convergence. I: Metastability and dominated convergence model theory and metric convergence
• On the mathematical and foundational significance of the uncountable
• Ultraproducts and metastability
• Rates of metastability for iterations on the unit interval
• On the extraction of computational content from noneffective convergence proofs in analysis
• Notions of Cauchyness and metastability

This page was built for publication: Metastability and higher-order computability

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