On the definition of computable functionals

DOI10.4064/fm-42-2-232-239zbMath0067.00301OpenAlexW745134671MaRDI QIDQ3227569

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

Related Items

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