Analysis in the Computable Number Field

DOI10.1145/321450.321460zbMATH Open0159.01201OpenAlexW2034440051MaRDI QIDQ5542101FDOQ5542101

Authors: O. Alberth 

Publication date: 1968

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321450.321460

zbMATH Keywords

mathematical logic

Cited In (8)

• Computational complexity of real functions
• A Chain of Inclusion Relations in Computable Analysis
• Constructive analysis and thermodynamics formulations
• Optimisation impossible
• The prime number theorem is PRA-provable
• Title not available (Why is that?)
• The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
• The concept of effective method applied to computational problems of linear algebra

This page was built for publication: Analysis in the Computable Number Field

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