Mathematics based on incremental learning -- excluded middle and inductive inference
From MaRDI portal
Publication:817838
DOI10.1016/J.TCS.2005.10.019zbMath1086.68063OpenAlexW2055924668MaRDI QIDQ817838
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.019
Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20) Other constructive mathematics (03F65) Metamathematics of constructive systems (03F50)
Related Items (11)
Effectivity questions for Kleene's recursion theorem ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Inductive inference and reverse mathematics ⋮ Fluctuations, effective learnability and metastability in analysis ⋮ Games with 1-backtracking ⋮ A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) ⋮ Toward the interpretation of non-constructive reasoning as non-monotonic learning ⋮ A New Translation for Semi-classical Theories — Backtracking without CPS ⋮ A computable version of Banach's inverse mapping theorem ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1
Cites Work
- Classical recursion theory. Vol. II
- On degrees of unsolvability
- Lifschitz' realizability
- CT 0 is Stronger than CT 0 !
- Classical logic as limit completion
- A semantics of evidence for classical arithmetic
- Parsimony hierarchies for inductive inference
- Automata, Languages and Programming
- Towards the animation of proofs -- testing proofs by examples
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Mathematics based on incremental learning -- excluded middle and inductive inference
