Search results for "FC"

showing 2 items of 1442 documents

On the Amount of Nonconstructivity in Learning Recursive Functions

2011

Nonconstructive proofs are a powerful mechanism in mathematics. Furthermore, nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [17] and Freivalds [11]. They allow to regard more complicated algorithms from the viewpoint of much more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem. In the present paper, the amount of nonconstructivity in learning of recursive functions is studied. Different learning types are compared with respect to the amount of nonconstructivity needed to lea…

μ operatorClass (set theory)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoretical computer sciencePrimitive recursive functionData_CODINGANDINFORMATIONTHEORYInductive reasoningMathematical proofUpper and lower boundsAlgorithmμ-recursive functionAutomatonMathematics
researchProduct

Some characterisations of groups in which normality is a transitive relation by means of subgroup embedding properties

2018

[EN] In this survey we highlight the relations between some subgroup embedding properties that characterise groups in which normality is a transitive relation in certain universes of groups with some finiteness properties.

‎group without infinite‎ ‎simple sectionsSubgroup&#8206FC&#8727lcsh:Mathematics-Group&#8206‎T-group‎Group Without Infinite&#8206Grups Teoria desubgroup embedding propertieslcsh:QA1-939t-property&#8206‎subgroup‎ ‎embedding property‎‎FC$^*$-group‎Group&#8206Simple Sectionst-property subgroup embedding properties‎group‎Embedding Property&#8206MATEMATICA APLICADAT-Group&#8206
researchProduct