Seguir
Lorenzo Carlucci
Lorenzo Carlucci
Associate Professor of Computer Science University of Roma La Sapienza
Dirección de correo verificada de di.uniroma1.it - Página principal
Título
Citado por
Citado por
Año
On the Necessity of U‐Shaped Learning
L Carlucci, J Case
Topics in cognitive Science 5 (1), 56-88, 2013
732013
Results on memory-limited U-shaped learning
L Carlucci, J Case, S Jain, F Stephan
Information and Computation 205 (10), 1551-1573, 2007
42*2007
Unprovability results involving braids
L Carlucci, P Dehornoy, A Weiermann
Proceedings of the London Mathematical Society 102 (1), 159-192, 2011
212011
Variations on U-shaped learning
L Carlucci, S Jain, E Kinber, F Stephan
Information and Computation 204 (8), 1264-1294, 2006
202006
Non U-shaped vacillatory and team learning
L Carlucci, J Case, S Jain, F Stephan
Algorithmic Learning Theory: 16th International Conference, ALT 2005 …, 2005
192005
Worms, gaps, and hydras
L Carlucci
Mathematical Logic Quarterly 51 (4), 342-350, 2005
162005
Non-U-shaped vacillatory and team learning
L Carlucci, J Case, S Jain, F Stephan
Journal of Computer and System Sciences 74 (4), 409-430, 2008
152008
Learning correction grammars
L Carlucci, J Case, S Jain
The Journal of Symbolic Logic 74 (2), 489-516, 2009
132009
Sharp thresholds for hypergraph regressive Ramsey numbers
L Carlucci, G Lee, A Weiermann
Journal of Combinatorial Theory, Series A 118 (2), 558-585, 2011
122011
Variations on U-Shaped Learning.
L Carlucci, S Jain, EB Kinber, F Stephan
COLT, 382-397, 2005
112005
“Weak yet strong” restrictions of Hindman’s Finite Sums Theorem
L Carlucci
Proceedings of the American Mathematical Society 146 (2), 819-829, 2018
102018
Classifying the phase transition threshold for regressive Ramsey functions
L Carlucci, G Lee, A Weiermann
preprint, 2006
102006
A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem
L Carlucci
Archive for Mathematical Logic 57 (3-4), 381-389, 2018
92018
A new proof-theoretic proof of the independence of Kirby–Paris’ Hydra Theorem
L Carlucci
Theoretical Computer Science 300 (1-3), 365-378, 2003
92003
New bounds on the strength of some restrictions of Hindman’s Theorem
L Carlucci, LA Kołodziejczyk, F Lepore, K Zdanowski
Computability 9 (2), 139-153, 2020
82020
U-shaped learning may be necessary 3
L Carluccia, J Caseb, S Jainc, F Stephand
82005
A note on Hindman-type theorems for uncountable cardinals
L Carlucci
Order 36 (1), 19-22, 2019
72019
The strength of Ramsey’s theorem for coloring relatively large sets
L Carlucci, K Zdanowski
The Journal of Symbolic Logic 79 (1), 89-102, 2014
62014
Paris-harrington tautologies
L Carlucci, N Galesi, M Lauria
2011 IEEE 26th Annual Conference on Computational Complexity, 93-103, 2011
42011
Restrictions of Hindman’s Theorem: An Overview
L Carlucci
Connecting with Computability: 17th Conference on Computability in Europe …, 2021
32021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20