Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems

A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior as a typical point of the system. It was proved in [Avigad et al. 2010, Local stability of ergodic averages] that in a system whose dynamics is computable the ergodic averages of computable observables converge effectively. We give an alternative, simpler proof of this result. This implies that if also the invariant measure is computable then the pseudorandom points are a set which is dense (hence nonempty) on the support of the invariant measure

Recolección, procesamiento y transformación de datos desde p aginas web, referentes a las personas de nacionalidad chilena, para la creación de nuevo conocimiento

59 p.Poseer información en el momento justo de la toma de decisiones, en muchos casos es sinonimo de poder. En el pasado solo los mejor posicionados y con mayores recursos puedan tener acceso a esta información, pero hoy en día existe Internet, herramienta con la cual cualquier persona con los conocimientos necesarios puede acceder a esta información, sin necesidad de vulnerar ningún tipo de seguridad,esto a causa de la poca preocupación por parte de las entidades que poseen dicha información y su casi nula seguridad al momento de brindarla en Internet. En la presente memoria se muestra como fue efectuada la recolección de datos desde sitios web, los cuales no todos entregan los datos de manera directa, a pesar de esto, no se infringió ninguna ley. Se muestra con que herramientas y de que manera se realizo el procesamiento y transformación de estos datos y por ultimo se puede apreciar la cantidad de datos que fueron recolectados, en cuanto tiempo y algunos procesos de mejora en la recolección

Alternative Lines of Action for the Design of Online Multimedia Material Directed towards the Collaborative Training of Teachers in the Design of the Teaching

The aim of the study was to evaluate the potential for online multimedia materials as alternative learning tools for the collaborative training of teachers in the design of research-based teaching. A case study using a team of three trainee teachers was used to develop a process of initial training in the design of a constructivist and research-based teaching unit supported by online multimedia material. The results obtained from the research allowed some principles to be identified, and basic recommendations and alternative lines of action to be given for designing online multimedia materials. Online multimedia materials can be alternative teaching tools that contribute (with other materials) to the development of constructivist, collaborative and research-based strategies which help provide the necessary support for improving the initial and ongoing training of new teachers in the design of teaching from a research perspectiv

Improving the Quality of Teaching Internships with the Help of the Platforms

This article presents an empirical study on the perceptions of university students toward the development of the teaching practicum, using the CourseSites platform as a communication and support tool for their training. The opinions of the students were collected through a questionnaire. The sample consisted of 1500 students who were registered in the degrees of Early Childhood Education, Primary Education and Pedagogy (2008-2018). A descriptive, inferential and multi-level analysis was conducted, which confirmed that future teachers had activated their professional competences, as they had the chance to share their internship experiences with their faculty members and with their own classmates

Values of the Parents of Pupils with Special Educational Needs due to Sociocultural Background

The aim of the study was to investigate the values behind the nature and behaviour of parents with children who have Special Educational Needs, and the way they approach their children´s schooling. The views of two hundred and sixty-eight parents living in a socially and culturally disadvantaged area, were evaluated using the Hall-Tonna Inventory of Values. The results showed that there are differences in the parents’ hierarchy of values according to whether the school they have chosen for their children is inside or outside the area. The principle differences are in the content of some of the priority values selected by each group, and/or in the priority that each group gives to some of the values common to both groups. The implications of how the parents prioritise the values are discussed with regard to their own personal development and the education of their children

No Agreement Without Loss: Learning and Social Choice in Peer Review

In peer review systems, reviewers are often asked to evaluate various features of submissions, such as technical quality or novelty. A score is given to each of the predefined features and based on these the reviewer has to provide an overall quantitative recommendation. However, reviewers differ in how much they value different features. It may be assumed that each reviewer has her own mapping from a set of criteria scores (score vectors) to a recommendation, and that different reviewers have different mappings in mind. Recently, Noothigattu, Shah and Procaccia introduced a novel framework for obtaining an aggregated mapping by means of Empirical Risk Minimization based on $L(p,q)$ loss functions, and studied its axiomatic properties in the sense of social choice theory. We provide a body of new results about this framework. On the one hand we study a trade-off between strategy-proofness and the ability of the method to properly capture agreements of the majority of reviewers. On the other hand, we show that dropping a certain unrealistic assumption makes the previously reported results to be no longer valid. Moreover, in the general case, strategy-proofness fails dramatically in the sense that a reviewer is able to make significant changes to the solution in her favor by arbitrarily small changes to their true beliefs. In particular, no approximate version of strategy-proofness is possible in this general setting since the method is not even continuous w.r.t. the data. Finally we propose a modified aggregation algorithm which is continuous and show that it has good axiomatic properties.Comment: preprint submitted to a conferenc

On the Information Carried by Programs About the Objects they Compute

International audienceIn computability theory and computable analysis, finite programs can compute infinite objects. Such objects can then be represented by finite programs. Can one characterize the additional useful information contained in a program computing an object, as compared to having the object itself? Having a program immediately gives an upper bound on the Kolmogorov complexity of the object, by simply measuring the length of the program, and such an information cannot usually be derived from an infinite representation of the object. We prove that bounding the Kolmogorov complexity of the object is the only additional useful information. Hence we identify the exact relationship between Markov-computability and Type-2-computability. We then use this relationship to obtain several results characterizing the computational and topological structure of Markov-semidecidable sets. This article is an extended version of [8], including complete proofs and a new result (Theorem 9)

Componer la vida artísticamente: aproximación a la génesis filosófica del concepto de autopoiesis

These pages would want to be a map for the reader which he would use to find some hermeneutics keys and to understand the way of the thought that postulates life as an art work. Thus, the purpose of the essay is to suggest a philosophical hypothesis about the origin of this notion and, at the same time, to explain some of the decisive factors in the process of shaping of this phenomenon of artistic life.    Las páginas que conforman este breve ensayo proveerán al lector de un atlas en el que podrán encontrarse algunas claves hermenéuticas que prometen ser de utilidad a la hora de comprender el modo en el que ha ido gestándose la idea que postula que la vida pueda ser pensada en tanto que obra artística. De esta forma, el propósito del artículo que nos ocupa será el de aventurar una hipótesis filosófica acerca de la procedencia de dicha noción y, de modo simultáneo, el de dilucidar algunos de los factores determinantes en la configuración de este fenómeno de la vida artística.   &nbsp

On the Information Carried by Programs About the Objects they Compute

International audienceIn computability theory and computable analysis, finite programs can compute infinite objects. Such objects can then be represented by finite programs. Can one characterize the additional useful information contained in a program computing an object, as compared to having the object itself? Having a program immediately gives an upper bound on the Kolmogorov complexity of the object, by simply measuring the length of the program, and such an information cannot usually be derived from an infinite representation of the object. We prove that bounding the Kolmogorov complexity of the object is the only additional useful information. Hence we identify the exact relationship between Markov-computability and Type-2-computability. We then use this relationship to obtain several results characterizing the computational and topological structure of Markov-semidecidable sets. This article is an extended version of [8], including complete proofs and a new result (Theorem 9)