Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Luca San Mauro"'
Publikováno v:
Computability. 11:187-221
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations R and S on natural numbers, R is computably reducible to S if th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89f454b1e7c9382852bd6e4af3316f8d
https://doi.org/10.3233/com-210375
https://doi.org/10.3233/com-210375
Publikováno v:
Synthese. 201
Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9b2e84363ccdd9e824cb5431a66576e
https://doi.org/10.1007/s11229-023-04056-y
https://doi.org/10.1007/s11229-023-04056-y
Autor:
Matteo, Plebani, Luca, San Mauro
Publikováno v:
Clinical chemistry and laboratory medicineReferences. 60(12)
Artificial intelligence plays an important role in contemporary medicine. In this short note, we emphasize that philosophy played a role in the development of artificial intelligence. We argue that research in computability theory, the theoretical fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::99d18f3c822de506ab31e94af2d5052e
https://pubmed.ncbi.nlm.nih.gov/35968830
https://pubmed.ncbi.nlm.nih.gov/35968830
Publikováno v:
Synthese. 198:10063-10087
We offer a novel picture of mathematical language from the perspective of speech act theory. There are distinct speech acts within mathematics (not just assertions), and, as we intend to show, distinct illocutionary force indicators as well. Even mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7147773584adacb9829ebd9384ad31dc
https://doi.org/10.1007/s11229-020-02702-3
https://doi.org/10.1007/s11229-020-02702-3
Publikováno v:
Revolutions and Revelations in Computability ISBN: 9783031087394
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::125546af9657a6263f19bdd173d0c32b
https://doi.org/10.1007/978-3-031-08740-0_1
https://doi.org/10.1007/978-3-031-08740-0_1
We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each stage, is required to output a conjecture about the isomorphism type of s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a5660a30715bb1806e85a8b9e94219c
http://arxiv.org/abs/2110.14512
http://arxiv.org/abs/2110.14512
Publikováno v:
Computability. 8:265-280
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d8014b9bc68a7f733a0421427290ede
https://doi.org/10.3233/com-180100
https://doi.org/10.3233/com-180100
Autor:
Nikolay Bazhenov, Luca San Mauro
In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to isomorphism). In this paper, we measure the computational power that is n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::667347bac776b89c465d6977c403f63d
http://arxiv.org/abs/2106.14515
http://arxiv.org/abs/2106.14515
In this short paper, we analyse whether assuming that mathematical objects are “thin” in Linnebo's sense simplifies the epistemology of mathematics. Towards this end, we introduce the notion of transparency and show that not all thin objects are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06be6ddf9a2849fdcb147a791d91c34f
Publikováno v:
Logic, Rationality, and Interaction ISBN: 9783030887070
LORI
LORI
Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2409a7d5771708b59313598618549ca
https://doi.org/10.1007/978-3-030-88708-7_1
https://doi.org/10.1007/978-3-030-88708-7_1