scientific article; zbMATH DE number 2085171

MaRDI QIDQ4736394zbMATH OpenFDO

Authors Susumu Hayashi, Masahiro Nakata

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2277/22770125.htm

zbMATH Keywords

computational content of LCM-proofsfragment of classical mathematicslearninglimiting recursive functionsproof animation

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Recursive functions and relations, subrecursive hierarchies (03D20) Second- and higher-order arithmetic and fragments (03F35) Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 1948150
• scientific article; zbMATH DE number 1783013
• Automata, Languages and Programming
• Mathematics based on incremental learning -- excluded middle and inductive inference
• scientific article; zbMATH DE number 1966517

Cited in

(19)

• On the limits of computations with the floor function
• Computability of a function with jumps: Effective uniformity and limiting recursion
• Automatic learning from positive data and negative counterexamples
• A sequent calculus for limit computable mathematics
• scientific article; zbMATH DE number 4160688 (Why is no real title available?)
• Positive Arithmetic Without Exchange Is a Subclassical Logic
• Fluctuations, effective learnability and metastability in analysis
• From heaps of matches to the limits of computability
• scientific article; zbMATH DE number 1948150 (Why is no real title available?)
• scientific article; zbMATH DE number 1966517 (Why is no real title available?)
• scientific article; zbMATH DE number 1966601 (Why is no real title available?)
• scientific article; zbMATH DE number 1783013 (Why is no real title available?)
• scientific article; zbMATH DE number 1396730 (Why is no real title available?)
• A New Translation for Semi-classical Theories — Backtracking without CPS
• Automata, Languages and Programming
• Learning and computing in the limit
• The limits of fixed-order computation
• Games with 1-backtracking
• Mathematics based on incremental learning -- excluded middle and inductive inference

This page was built for publication:

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