Search results for "Cursive"

Towards multilingual competence: examining beliefs and agency in first year university students’ language learner biographies

2021

As working life across the world is increasingly multilingual, multicultural and multidisciplinary, higher education language teaching is faced with a challenge of how to prepare students for it. Many universities have recently developed multilingual pedagogies but central to their success is learners’ perceptions of these practices. To fill this gap, this article explores first year university students’ language learner biographies to gain insight into how learners construct their linguistic realities. The biographies were studied with discourse analytical methods to examine the participants’ beliefs about language learning and their sense of agency in it. The results reveal that participa…

Discordances in Ascriptions of Agency and Reflectivity in the First Psychotherapy Session

2018

We analyzed the first sessions of nine long-term individual psychotherapies with a model of ten discursive tools of agency ascription and studied discursive discordances, sequences of two talk turns in which the therapeutic dyad was misaligned in terms of how they ascribed agency to the client. We also studied how the clients’ agency self-ascriptions in the turn immediately following the discordances changed from the first turn. Classifying these discordance sequences, eight different types of sequences were found. One, in which the clients’ reflective agency constructions were missed by the therapists, was subjected to a detailed analysis. peerReviewed

In nomine patris: Discursive strategies and ideology in the Cosa Nostra family discourse

2017

Abstract The article investigates how Cosa Nostra family discourse is characterized by a series of discursive strategies that give shape to specific ideological structures. By analysing a TV interview to the son of Bernardo Provenzano, boss of Cosa Nostra, it is possible to understand how the criminal values and practices are maintained and reproduced within the father–son relationship. Specifically, we show how the son justifies, legitimises or denies the criminal actions of his father. The ideology of Cosa Nostra seems to be based on the inter-generational cultural continuity of its members, on the family as main locus of adherence, reductionism of its mediatic image, amoralism as father–…

Co-learning of total recursive functions

1994

Framing the 26J: the discursive advertising strategy of Cs on Twitter in the 26J campaign.

2021

Este trabajo analiza la estrategia comunicativa de Ciudadanos para la difusión de sus spots en Twitter durante la campaña de las elecciones generales del 26 de julio de 2016. En la investigación se emplean técnicas de análisis cuantitativo y cualitativo, estas se basan en el modelo discursivo de encuadre de Gallardo-Paúls (2014, 2021) que aquí adaptamos, identificando categorías específicas del lenguaje audiovisual. Los resultados muestran, en primer lugar, que el empleo de Twitter para la difusión del spot electoral fue muy escaso. Por otra parte, la argumentación fundamental que preside la estrategia textual del encuadre fue mostrarse como el partido de la unión y el cambio. En el ámbito …

Anthropology of Political, Social and Cultural Memory: Practices in Central and Eastern Europe: Program & Abstracts : International Scientific Confer…

2020

Co-learnability and FIN-identifiability of enumerable classes of total recursive functions

1994

Co-learnability is an inference process where instead of producing the final result, the strategy produces all the natural numbers but one, and the omitted number is an encoding of the correct result. It has been proved in [1] that co-learnability of Goedel numbers is equivalent to EX-identifiability. We consider co-learnability of indices in recursively enumerable (r.e.) numberings. The power of co-learnability depends on the numberings used. Every r.e. class of total recursive functions is co-learnable in some r.e. numbering. FIN-identifiable classes are co-learnable in all r.e. numberings, and classes containing a function being accumulation point are not co-learnable in some r.e. number…

Unions of identifiable classes of total recursive functions

1992

J.Barzdin [Bar74] has proved that there are classes of total recursive functions which are EX-identifiable but their union is not. We prove that there are no 3 classes U1, U2, U3 such that U1∪U2,U1∪U3 and U2∪U3 would be in EX but U1∪U2∪U3∉ EX. For FIN-identification there are 3 classes with the above-mentioned property and there are no 4 classes U1, U2, U3, U4 such that all 4 unions of triples of these classes would be identifiable but the union of all 4 classes would not. For identification with no more than p minchanges a (2p+2−1)-tuple of such classes do exist but there is no (2p+2)-tuple with the above-mentioned properly.

Structured Frequency Algorithms

2015

B.A. Trakhtenbrot proved that in frequency computability (introduced by G. Rose) it is crucially important whether the frequency exceeds \(\frac{1}{2}\). If it does then only recursive sets are frequency-computable. If the frequency does not exceed \(\frac{1}{2}\) then a continuum of sets is frequency-computable. Similar results for finite automata were proved by E.B. Kinber and H. Austinat et al. We generalize the notion of frequency computability demanding a specific structure for the correct answers. We show that if this structure is described in terms of finite projective planes then even a frequency \(O(\frac{\sqrt{n}}{n})\) ensures recursivity of the computable set. We also show that …

On the inductive inference of recursive real-valued functions

1999

AbstractWe combine traditional studies of inductive inference and classical continuous mathematics to produce a study of learning real-valued functions. We consider two possible ways to model the learning by example of functions with domain and range the real numbers. The first approach considers functions as represented by computable analytic functions. The second considers arbitrary computable functions of recursive real numbers. In each case we find natural examples of learnable classes of functions and unlearnable classes of functions.