scientific article; zbMATH DE number 3503215

MaRDI QIDQ4083409zbMATH OpenFDO

Authors Giovanni Criscuolo, Eliana Minicozzi, Giuseppe Trautteur

Publication date 1975

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites work

• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3387326 (Why is no real title available?)
• Iterated Limiting Recursion and the Program Minimization Problem
• Language identification in the limit
• Limiting recursion
• Minimal-program complexity of sequences with restricted resources
• Some decidability results on grammatical inference and complexity
• Su certe teorie non enumerabili. (Sulle limitazioni dei sistemi formali. I.)
• Toward a mathematical theory of inductive inference
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(2)

• A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)
• Toward the interpretation of non-constructive reasoning as non-monotonic learning

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 Q4083409)