Reports de recercahttp://hdl.handle.net/2117/34882024-03-28T23:50:45Z2024-03-28T23:50:45ZBateria de afasias Western. Cuaderno de estímulos en castellano.Zaragoza Cortés, MaiteDiéguez-Vide, FaustinoGómez Ruiz, María IsabelRosell Clarí, VicentCatala Roig, NeusBaixeries i Juvillà, JaumeHernández Fernández, Antoniohttp://hdl.handle.net/2117/3771702022-11-25T13:20:26Z2022-11-25T13:17:01ZBateria de afasias Western. Cuaderno de estímulos en castellano.
Zaragoza Cortés, Maite; Diéguez-Vide, Faustino; Gómez Ruiz, María Isabel; Rosell Clarí, Vicent; Catala Roig, Neus; Baixeries i Juvillà, Jaume; Hernández Fernández, Antonio
Quadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia. Es pot aplicar per a controls monolingües en l'estudi en contextos bilingües.
Quadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia.
2022-11-25T13:17:01ZZaragoza Cortés, MaiteDiéguez-Vide, FaustinoGómez Ruiz, María IsabelRosell Clarí, VicentCatala Roig, NeusBaixeries i Juvillà, JaumeHernández Fernández, AntonioQuadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia. Es pot aplicar per a controls monolingües en l'estudi en contextos bilingües.A note on the query complexity of learning DFABalcázar Navarro, José LuisDíaz Cort, JosepGavaldà Mestre, RicardWatanabe, Osamuhttp://hdl.handle.net/2117/3707042022-07-24T01:38:24Z2022-07-20T11:08:38ZA note on the query complexity of learning DFA
Balcázar Navarro, José Luis; Díaz Cort, Josep; Gavaldà Mestre, Ricard; Watanabe, Osamu
It is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries for learning deterministic finite automata. First we consider two different learning situations and show lower bounds on the query complexity of learning deterministic finite automata. We then investigate the query complexity in general setting, and show some trade-off phenomenon between the number of membership and equivalence queries.
2022-07-20T11:08:38ZBalcázar Navarro, José LuisDíaz Cort, JosepGavaldà Mestre, RicardWatanabe, OsamuIt is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate -- the query complexity -- the number of membership and equivalence queries for learning deterministic finite automata. First we consider two different learning situations and show lower bounds on the query complexity of learning deterministic finite automata. We then investigate the query complexity in general setting, and show some trade-off phenomenon between the number of membership and equivalence queries.Categorical formalisation of relativisation : pied piping, islands, and extraction sitesMorrill, Glynhttp://hdl.handle.net/2117/3706182022-07-20T08:30:21Z2022-07-20T08:27:50ZCategorical formalisation of relativisation : pied piping, islands, and extraction sites
Morrill, Glyn
2022-07-20T08:27:50ZMorrill, GlynA first-order isomorphism theoremAllender, EricBalcázar Navarro, José LuisImmerman, Neilhttp://hdl.handle.net/2117/3706092022-07-20T08:10:17Z2022-07-20T08:05:27ZA first-order isomorphism theorem
Allender, Eric; Balcázar Navarro, José Luis; Immerman, Neil
We show that for most complexity classes of interest, all sets complete under first-order projections are isomorphic under first-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds.
2022-07-20T08:05:27ZAllender, EricBalcázar Navarro, José LuisImmerman, NeilWe show that for most complexity classes of interest, all sets complete under first-order projections are isomorphic under first-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds.Some structural complexity aspects of neural computationBalcázar Navarro, José LuisGavaldà Mestre, RicardSiegelmann, H.Sontag, Eduardo D.http://hdl.handle.net/2117/3703662022-07-24T03:19:28Z2022-07-18T12:18:31ZSome structural complexity aspects of neural computation
Balcázar Navarro, José Luis; Gavaldà Mestre, Ricard; Siegelmann, H.; Sontag, Eduardo D.
Recent work by Siegelmann and Sontag has demonstrated that polynomial time on linear saturated recurrent neural networks equas polynomial time on standard computational models: Turing machines if the weights of the net are rationals, and nonuniform circuits if the weights are reals. Here we develop further connections between the languages recognized by such neural nets and other complexity classes. We present connections to space-bounded classes, simulation of parallel computational models such as Vector Machines, and a discussion of the characterizations of various nonuniform classes in terms of Kolmogorov complexity.
2022-07-18T12:18:31ZBalcázar Navarro, José LuisGavaldà Mestre, RicardSiegelmann, H.Sontag, Eduardo D.Recent work by Siegelmann and Sontag has demonstrated that polynomial time on linear saturated recurrent neural networks equas polynomial time on standard computational models: Turing machines if the weights of the net are rationals, and nonuniform circuits if the weights are reals. Here we develop further connections between the languages recognized by such neural nets and other complexity classes. We present connections to space-bounded classes, simulation of parallel computational models such as Vector Machines, and a discussion of the characterizations of various nonuniform classes in terms of Kolmogorov complexity.The [Theta]-operator and the low hierarchyCastro Rabal, JorgeSeara Ojea, Carloshttp://hdl.handle.net/2117/3701372022-07-13T10:40:15Z2022-07-13T10:39:14ZThe [Theta]-operator and the low hierarchy
Castro Rabal, Jorge; Seara Ojea, Carlos
Long and Sheu in their paper [LS-91] introduced a refinement of the low hierarchy based on the [Theta]-levels of the polynomial time hierarchy which gives a deeper sight of the internal structure of NP. In this paper we show a surprising property of the [Theta]-operator and as a consequence, we get easily the [Theta]-lowness results given in [LS-91]. Besides, we clarify the situation of the classes in L[supra P,[Alpha]] [sub 2] for which their membership to L[supra P,[Theta]] [sub 2] was not clear.
S'estudien propietats de l'operador Theta y les seves conseqüències sobre la jerarquia low
2022-07-13T10:39:14ZCastro Rabal, JorgeSeara Ojea, CarlosLong and Sheu in their paper [LS-91] introduced a refinement of the low hierarchy based on the [Theta]-levels of the polynomial time hierarchy which gives a deeper sight of the internal structure of NP. In this paper we show a surprising property of the [Theta]-operator and as a consequence, we get easily the [Theta]-lowness results given in [LS-91]. Besides, we clarify the situation of the classes in L[supra P,[Alpha]] [sub 2] for which their membership to L[supra P,[Theta]] [sub 2] was not clear.Apuntes sobre el cálculo de la eficiencia de los algoritmosBalcázar Navarro, José Luishttp://hdl.handle.net/2117/3701342022-07-13T10:10:15Z2022-07-13T10:03:21ZApuntes sobre el cálculo de la eficiencia de los algoritmos
Balcázar Navarro, José Luis
2022-07-13T10:03:21ZBalcázar Navarro, José LuisAnàlisi d'un algorisme de multiplicació d'entersMarco Gómez, JordiBalcázar Navarro, José Luishttp://hdl.handle.net/2117/3701332022-07-13T10:00:24Z2022-07-13T09:57:37ZAnàlisi d'un algorisme de multiplicació d'enters
Marco Gómez, Jordi; Balcázar Navarro, José Luis
Es proposa un algorisme de multiplicació d'enters basat en l'esquema "divideix i venç", però diferent del de Karatsuba i Ofman. Es fa l'anàlisi de la seva complexitat. Es troba que, encara que sembli millor que els ja coneguts si el cost de la suma es considera constant, fent la hipótesi, més realista, que la suma requereix temps lineal, el cost total puja fins a quadràtic.
We present a fast algorithms for integer product, based on the
2022-07-13T09:57:37ZMarco Gómez, JordiBalcázar Navarro, José LuisEs proposa un algorisme de multiplicació d'enters basat en l'esquema "divideix i venç", però diferent del de Karatsuba i Ofman. Es fa l'anàlisi de la seva complexitat. Es troba que, encara que sembli millor que els ja coneguts si el cost de la suma es considera constant, fent la hipótesi, més realista, que la suma requereix temps lineal, el cost total puja fins a quadràtic.Una altra demostració del teorema de CookGavaldà Mestre, Ricardhttp://hdl.handle.net/2117/3700842022-07-13T08:20:15Z2022-07-13T08:19:50ZUna altra demostració del teorema de Cook
Gavaldà Mestre, Ricard
Presentem una demostració alternativa del Teorema de Cook: saber si una fòrmula booleana és satisfactible és un problema NP-complet. La demostració es diferencia de les altres que conec en dos aspectes. Un, que defineixo NP en termes de verificadors i no d'indeterminisme. L'altre, que faig servir com a model de càlcul la màquina RAM i no la màquina de Turing.
2022-07-13T08:19:50ZGavaldà Mestre, RicardPresentem una demostració alternativa del Teorema de Cook: saber si una fòrmula booleana és satisfactible és un problema NP-complet. La demostració es diferencia de les altres que conec en dos aspectes. Un, que defineixo NP en termes de verificadors i no d'indeterminisme. L'altre, que faig servir com a model de càlcul la màquina RAM i no la màquina de Turing.The complexity of learning with queriesGavaldà Mestre, Ricardhttp://hdl.handle.net/2117/3700542022-07-12T14:30:21Z2022-07-12T14:30:05ZThe complexity of learning with queries
Gavaldà Mestre, Ricard
We survey recent research concerning the qualitative complexity of Angluin's model of learning with queries. In this model, there is a learner that tries to identify a target concept by means of queries to a teacher. Thus, the process can be naturally formulated as an oracle computation. Among the results we review there are: characterizations of the power of different learning protocols by complexity classes of oracle machines; relations between the complexity of learning and the complexity of computing advice functions for nonuniform classes; and combinatorial characterizations of the concept classes that are learnable in specific protocols.
2022-07-12T14:30:05ZGavaldà Mestre, RicardWe survey recent research concerning the qualitative complexity of Angluin's model of learning with queries. In this model, there is a learner that tries to identify a target concept by means of queries to a teacher. Thus, the process can be naturally formulated as an oracle computation. Among the results we review there are: characterizations of the power of different learning protocols by complexity classes of oracle machines; relations between the complexity of learning and the complexity of computing advice functions for nonuniform classes; and combinatorial characterizations of the concept classes that are learnable in specific protocols.