On the definition of computable functionals

DOI10.4064/FM-42-2-232-239MaRDI QIDQ3227569zbMATH OpenOpenAlexFDO

Authors Andrzej Grzegorczyk

Publication date 1955

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/213380

zbMATH Keywords

philosophy and foundations of mathematics

Cited in

(7)

• Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
• Parametrised second-order complexity theory with applications to the study of interval computation
• Functions computable by a computer
• Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
• Real Number Calculations and Theorem Proving
• COMPUTABLY COMPACT METRIC SPACES
• Three concepts of decidability for general subsets of uncountable spaces

This page was built for publication: On the definition of computable functionals

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