We study computability of the abstract linear Cauchy problem equation image)where A is a linear operator, possibly unbounded, on a Banach space X. We give necessary and sufficient conditions for A such that the solution operator K: x ↦ u of the problem is computable. For studying computability we use the representation approach to computable analysis developed by Weihrauch and others. This approach is consistent with the model used by Pour-El/Richards.

The article discusses the possibilities of the formal analysis of the fine-art painting composition on the basis of the classical definitions of beauty and computational aesthetics’ approaches of the second half of the 20th century he authors define the problem and consider solutions for the formalization of aesthetic perception in the context of aesthetic text, i.e., as part of the fine arts composition – a formal sequence of signs simply ordered in accordance with the syntactic rules’ system. The methodology (...) of the research is defined by the general semiotics, distinguishing semantics, syntax, and pragmatics of a sign, by the aesthetic analysis’ methods, ranging according to the author’s message aesthetics, receptive aesthetics, and text aesthetics, as well as by the computational analysis methods connected with neural network means of defining the images’ symmetry. The article reveals preconditions for the emergence and also the current state of computational aesthetics as an interdisciplinary branch of knowledge. Analyzing the problem from the perspective of philosophy, aesthetics, semiotics, and technology, the authors draw attention to the need to improve the computational aesthetics methods. Firstly, the existing methods do not always enable to describe the fine-art object adequately. Secondly, there exists the so-called reduction of aesthetic assertion transforming it into the assertion concerning the object’s external characteristics. As a result, the authors assume that the increasing complexity of the current mathematical models and the experts’ subjective assessment support will allow to reach a compromise solution that enables the development of computational aesthetics as a branch of knowledge. Enhancement and development of the mathematical models, taking into account the rules of semiotics and subjectivism of the human perception, is the relevant objective of computational analysis of the aesthetic fine-arts text. The results of the present research supports the classic statement regarding the underivability of semantic and pragmatic propositions from syntax. The research concludes that relevant objectives are to find a correlation between, one the one hand, the axes and points of symmetry, deriving from the neural simulation, and, on the other hand, aesthetic effect, emerging from the perception of fine-art paintings. (shrink)

The confrontations of stakeholder visions about agriculture and food production has become a focal point in the public sphere, coinciding with a diversification of agrifood models. This study analyzes the debates stemming from the coexistence of these models, particularly during the initial term of neoliberal-centrist Emmanuel Macron’s presidency in France. Employing collective monitoring from 2017 to 2021, a corpus of 958 online news and blog articles was compiled. Using a computational analysis, we reveal the framings and controversies emerging from (...) this media discourse. The macro-structuring of discourse on model coexistence revolves around scientific, economic and political framings. Coexistence is a complex of debates based on specific frames associated with specific arenas and actor configurations: growth of organic agriculture, transformations of agrifood systems, sciences of production and impacts, livestock and meat diet controversies, agroecological innovations, CAP reform criticism, discourse of peasant agriculture and State-Profession _co-gestion_. Employing global sentiment analysis and focusing on salient controversies, namely EGAlim law, pesticide regulations, and agribashing, we show the shift from conciliation to a hardening of debates. Finally, we discuss the causes and consequences of this trend. The political will to support the transition of agriculture remains influenced by the _co-gestion_ system, an inherited configuration of decision-makers instrumental in the agricultural modernization. As a consequence, significant agricultural challenges, particularly highlighted in the scientific macro-frame, persist unresolved. This lock-in of the agrifood system is based on defensive strategies that challenge the democratic debate about food and agricultural practices. (shrink)

INTRODUCTION In the course of their excavations on Delos, the sacred island of Apollo, archaeologists discovered considerable remains of an Egyptian cult. ...

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain (...) choice principles such as co-finite choice, discrete choice, interval choice, compact choice and closed choice, which are cornerstones among Weihrauch degrees and it turns out that certain core theorems in analysis can be classified naturally in this structure. In particular, we study theorems such as the Intermediate Value Theorem, the Baire Category Theorem, the Banach Inverse Mapping Theorem, the Closed Graph Theorem and the Uniform Boundedness Theorem. We also explore how existing classifications of the Hahn—Banach Theorem and Weak Kőnig's Lemma fit into this picture. Well-known omniscience principles from constructive mathematics such as LPO and LLPO can also naturally be considered as Weihrauch degrees and they play an important role in our classification. Based on this we compare the results of our classification with existing classifications in constructive and reverse mathematics and we claim that in a certain sense our classification is finer and sheds some new light on the computational content of the respective theorems. Our classification scheme does not require any particular logical framework or axiomatic setting, but it can be carried out in the framework of classical mathematics using tools of topology, computability theory and computable analysis. We develop a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem. Finally, we present a number of metatheorems that allow to derive upper bounds for the classification of the Weihrauch degree of many theorems and we discuss the Brouwer Fixed Point Theorem as an example. (shrink)

Energy contributes significantly in almost all aspects of human life as well as economic activities and plays a crucial role in the infrastructural development of a county to alleviate poverty. Generating energy from a renewable source such as small hydropower through the application of pump operating as a turbine mode called Pump as Turbine is one of the best alternatives to provide clean and inexpensive energy. Using Pump as Turbine helps in generating reasonably priced hydroelectric power for communities in underdeveloped (...) counties. This study investigates the effects of internal flow behaviour and performance of Pump as Turbine under different rotational speed and flow rate. The rotational speed is an essential physical parameter as it affects the Pump as Turbine operation. A model-specific speed centrifugal pump model with head 32, flow rate of 12.5 and the rotational speed of 2900 rpm, has been selected for the study. Numerical simulations have been conducted using the k-ω turbulence model to solve three-dimensional equations. The pump mode experimental data were used to confirm the results for better analysis. The results predicted that vortex and turbulent kinetic energy increase per rotational speed increase. Also, at the higher rotational speed, very high recirculation of flow is detected at the blade suction chamber, although the pressure side has a smooth flow. This study provides beneficial information which will serve as a reference to help improve PAT performance along with selecting PAT for a small hydropower site. Future works will consider the impact of blade thickness and cavitation in Pump as Turbine. (shrink)

We investigate Turing's contributions to computability theory for real numbers and real functions presented in [22, 24, 26]. In particular, it is shown how two fundamental approaches to computable analysis, the so-called ‘Type-2 Theory of Effectivity' (TTE) and the ‘realRAM machine' model, have their foundations in Turing's work, in spite of the two incompatible notions of computability they involve. It is also shown, by contrast, how the modern conceptual tools provided by these two paradigms allow a systematic interpretation (...) of Turing's pioneering work in the subject. (shrink)

In this study, we use temporally aligned word embeddings and a large diachronic corpus of English to quantify language change in a data-driven, scalable way, which is grounded in language use. We show a unique and reliable relation between measures of language change and age of acquisition (AoA) while controlling for frequency, contextual diversity, concreteness, length, dominant part of speech, orthographic neighborhood density, and diachronic frequency variation. We analyze measures of language change tackling both the change in lexical representations and (...) the change in the relation between lexical representations and the words with the most similar usage patterns, showing that they capture different aspects of language change. Our results show a unique relation between language change and AoA, which is stronger when considering neighborhood-level measures of language change: Words with more coherent diachronic usage patterns tend to be acquired earlier. The results support theories positing a link between ontogenetic and ethnogenetic processes in language. (shrink)

El autor analiza el pronunciamiento de Kierkegaard acerca de la mujer y lo femenino en el texto O lo Uno o lo Otro, especialmente en las partes I y II. Para esto, se seleccionaron palabras clave como “mujer”, “femenino”, “virginidad”, “novia”, “esposa”, entre muchas otras más y se empleó el programa de análisis comparativo SimCA 2.0 de Michael J. Greenacre con el objetivo de mostrar tanto las comunes como las diferentes posturas del esteta A y el esteta B, así como (...) ofrecer una serie de dimensiones discursivas presentes en el texto que arrojan un conjunto de conclusiones valiosas para la comprensión de esta obra kierkegaardiana y la postura del filósofo danés frente a la mujer y lo que le compete. Los resultados del análisis se muestran al final del artículo por medio de tablas que comparan el vocabulario de A y de B y muestran su frecuencia; otras figuras exhiben por medio de gráficas el comportamiento de las palabras clave frente a las dimensiones discursivas más importantes. (shrink)

In this article, we use a mix of computational techniques to identify textual shifts in the Ottoman şeyhülislams’ fetvas between the sixteenth and twentieth centuries. Our analysis, supplemented by a close reading of these texts, indicates that the fetvas underwent multiple forms of transformation, a consequence of the institutional evolution of the şeyhülislam’s fetva office that aimed to speed up and streamline the production of the fetvas: over time, the texts appropriated a more uniform character and came to contain (...) shorter responses. In the compositions of the questions, we identified many “trigger terms” that facilitated reflexive responses independent of the fetvas’ jurisprudential contexts, a tendency that became stronger after the second half of the seventeenth century. In addition, we propose in the article a methodology that measures the relative strengths of textual and conceptual links among the fetva corpora of various Ottoman şeyhülislams. This analysis informs us about possible paths of long-term evolution of this genre of jurisprudential documents. (shrink)

Comics are complex multimodal documents that make for intriguing materials to analyze with computer vision and computational linguistics. This review summarizes the growing developments in computational modeling which have been progressing to analyze visual narratives across their various substructures.

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. A basic property of Cantor space$2^ $ is Heine–Borel compactness: for any open covering of $2^ $, there is a finite subcovering. A natural question is: How hard is it to compute such a finite subcovering? We make this precise by analysing the complexity of so-called fan functionals that given any $G:2^ \to $, output (...) a finite sequence $\langle f_0, \ldots,f_n \rangle $ in $2^ $ such that the neighbourhoods defined from $\overline {f_i } G\left$ for $i \le n$ form a covering of $2^ $. A basic property of Cantor space in Nonstandard Analysis is Abraham Robinson’s nonstandard compactness, i.e., that every binary sequence is “infinitely close” to a standard binary sequence. We analyse the strength of this nonstandard compactness property of Cantor space, compared to the other axioms of Nonstandard Analysis and usual mathematics.Our study of yields exotic objects in computability theory, while leads to surprising results in Reverse Mathematics. We stress that and are highly intertwined, i.e., our study is holistic in nature in that results in computability theory yield results in Nonstandard Analysis and vice versa. (shrink)

This article is a computational enquiry into the different ways in which two words, assumed to be central to the eighteenth-century concept of aesthetics, were used across that century. Using word co-association measures designed specifically for this study, I show the markedly different lexis that surrounded the words ‘beauty’ and ‘beautiful’ in three decades of historical textual data from Eighteenth-Century Collections Online. Having demonstrated that these words were used in very different semantic contexts in the beginning, middle, and end of (...) the century, the article presents semantic network diagrams which further demonstrate the distinctness of noun from adjective. I argue that while ‘beautiful’ is suspended in a semantic space that is recognizably aesthetic, ‘beauty’ is not. Furthermore, that which is deemed ‘beautiful,’ according to the evidence presented here, presents something of a challenge to received narratives of how the concept of aesthetics developed throughout the eighteenth century. (shrink)

Research conducted on Brain-Computer Interfaces has grown considerably during the last decades. With the help of BCIs, users can gain a wide range of functions. Our aim in this paper is to analyze the impact of BCIs on autonomy. To this end, we introduce three abilities that most accounts of autonomy take to be essential: the ability to use information and knowledge to produce reasons; the ability to ensure that intended actions are effectively realized ; and the ability to enact (...) intentions within concrete relationships and contexts. We then consider the impact of BCI technology on each of these abilities. Although on first glance, BCIs solely enhance self-determination because they restore or improve abilities, we will show that there are other positive, but also negative impacts on user autonomy, which require further philosophical and ethical discussions. (shrink)

Computational models of infant word‐finding typically operate over transcriptions of infant‐directed speech corpora. It is now possible to test models of word segmentation on speech materials, rather than transcriptions of speech. We propose that such modeling efforts be conducted over the speech of the experimental stimuli used in studies measuring infants' capacity for learning from spoken sentences. Correspondence with infant outcomes in such experiments is an appropriate benchmark for models of infants. We demonstrate such an analysis by applying the (...) DP‐Parser model of Algayres and colleagues to auditory stimuli used in infant psycholinguistic experiments by Pelucchi and colleagues. The DP‐Parser model takes speech as input, and creates multiple overlapping embeddings from each utterance. Prospective words are identified as clusters of similar embedded segments. This allows segmentation of each utterance into possible words, using a dynamic programming method that maximizes the frequency of constituent segments. We show that DP‐Parse mimics American English learners' performance in extracting words from Italian sentences, favoring the segmentation of words with high syllabic transitional probability. This kind of computational analysis over actual stimuli from infant experiments may be helpful in tuning future models to match human performance. (shrink)

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied (...) in the evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert’s program due to Simpson [1988], and predicativism in the extended form due to Feferman and Schütte. -/- Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only omega-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a Pi-1-1 complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than Pi-1-1-CA0. (shrink)

L’analisi informatica di testi filosofici, la creazione di database, ipertesti o edizioni elettroniche non costituiscono più unicamente una ricerca di frontiera, ma sono da molti anni una risorsa preziosa per gli studi umanistici. Ora, non si tratta di richiedere alle macchine un ulteriore sforzo per comprendere il linguaggio umano, quanto piuttosto di perfezionare gli strumenti affinché esse possano essere a tutti gli effetti collaboratori di ricerca. Questo articolo è concepito come il resoconto di un esperimento finalizzato a documentare come le (...) associazioni lessicali di un gruppo selezionato di testi medievali possa offrire qualche suggerimento in merito ai loro contenuti teorici. Computer analysis of texts, creation of databases hypertexts and digital editions are not the final frontier of research anymore. Quite the contrary, from many years they have been representing a significant contribution to medieval studies. Therefore, we do not mean to make the computer able to grasp the meaning of human language and penetrate its secrets, but rather we aim at improving their tools, so that they will become an even more efficient equipment employed in research activities. This paper is thought as a sort of technical report with the proposed task to verify if an automatic identification of some word associations within a selected groups of medieval writings produces suggestions on the subject of the processed texts, able to be used in a theoretical inquiry. (shrink)

This paper deals with the question: What are the criteria that an adequate theory of computation has to meet? 1. Smith's answer: it has to meet the empirical criterion (i.e. doing justice to computational practice), the conceptual criterion (i.e. explaining all the underlying concepts) and the cognitive criterion (i.e. providing solid grounds for computationalism). 2. Piccinini's answer: it has to meet the objectivity criterion (i.e. identifying computation as a matter of fact), the explanation criterion (i.e. explaining the computer's behaviour), the (...) right things compute criterion, the miscomputation criterion (i.e. accounting for malfunctions), the taxonomy criterion (i.e. distinguishing between different classes of computers) and the empirical criterion. 3. Von Neumann's answer: it has to meet the precision and reliability of computers criterion, the single error criterion (i.e. addressing the impacts of errors) and the distinction between analogue and digital computers criterion. 4. “Everything” computes answer: it has to meet the implementation theory criterion by properly explaining the notion of implementation. -/- According to computationalists, minds are computational. Before we can judge the plausibility of any particular computationalist theory, we need to understand what notion of computation this theory employs. Although there are extant accounts of computation, any of which may, in principle, serve as a basis for computationalism, it isn’t clear that they’re all equivalent or even adequate as accounts of computation proper. By examining plausible alternatives to Smith’s adequacy criteria, our goal here is to resist his claim that no adequate account of computation proper is possible. (shrink)

Interest in the computational aspects of modeling has been steadily growing in philosophy of science. This paper aims to advance the discussion by articulating the way in which modeling and computational errors are related and by explaining the significance of error management strategies for the rational reconstruction of scientific practice. To this end, we first characterize the role and nature of modeling error in relation to a recipe for model construction known as Euler’s recipe. We then describe a general model (...) that allows us to assess the quality of numerical solutions in terms of measures of computational errors that are completely interpretable in terms of modeling error. Finally, we emphasize that this type of error analysis involves forms of perturbation analysis that go beyond the basic model-theoretical and statistical/probabilistic tools typically used to characterize the scientific method; this demands that we revise and complement our reconstructive toolbox in a way that can affect our normative image of science. (shrink)

This chapter will deal with an issue that is as much a problem for moral philosophy as it is for the computer world. My basic theme is that high technology, and computer technology in particular, raises ethical problems of a new sort that require considerable restructuring of our traditional ethical categories. It follows that our job as philosophers is not, as it is often thought to be, simply to apply ready-made categories to new situations; rather, it is to find new (...) categories, or new ways of interpreting old categories, in order to accommodate the challenges presented by new technologies. (shrink)

Marr's levels of analysis—computational, algorithmic, and implementation—have served cognitive science well over the last 30 years. But the recent increase in the popularity of the computational level raises a new challenge: How do we begin to relate models at different levels of analysis? We propose that it is possible to define levels of analysis that lie between the computational and the algorithmic, providing a way to build a bridge between computational- and algorithmic-level models. The key idea is (...) to push the notion of rationality, often used in defining computational-level models, deeper toward the algorithmic level. We offer a simple recipe for reverse-engineering the mind's cognitive strategies by deriving optimal algorithms for a series of increasingly more realistic abstract computational architectures, which we call “resource-rational analysis.”. (shrink)