scientific article; zbMATH DE number 3503215

zbMATH Open0322.02039MaRDI QIDQ4083409FDOQ4083409

Giovanni Criscuolo, Eliana Minicozzi, Giuseppe Trautteur

Publication date: 1975

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cites Work

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

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)