The subject of the research is utopian discourse, which unites all the variety of concepts related in one way or another to utopia, utopian dimension of reality and understanding of the Future (utopian element, utopian impulse, utopian optics, utopianism, utopian consciousness, utopian thinking, dystopia, etc.). Special attention is paid to the study of the explanatory and predictive potential of utopian discourse, identifying its boundaries and analysis of the relationship with ideological discourse. The conceptualization of utopian discourse is based on an (...) instrumental approach to utopia, which is complemented by the communicative approach and the interpretive concept of culture by K. Geertz, which justifies the possibility of considering utopian discourse as a semantic and symbolic matrix. The novelty of the research is to identify and substantiate the exaggerated dichotomy of thinking and otherness as the structure-forming elements of utopian discourse. This contributed to the assessment of utopian discourse as a peculiar but viable form of reflection of political reality and the construction, consolidation and comprehension of values. The proposed algorithm of thinking with dichotomies made it possible to trace the process of constructing utopian discourse on the basis of a pyramid of dichotomies, consisting of system-forming, key and peripheral dichotomies. The article clarifies that the otherness of utopian discourse is manifested in the historicity, radicality and inextricable connection of utopian discourse with the Present. The indicated specificity of utopian discourse has led to the clarification of the reasons for the negative and/or skeptical attitude towards utopia and utopian discourse, as well as to the definition of its strengths and weaknesses. The authors conclude that despite the identified shortcomings, which often lead utopias to periodic displacement from the framework of actual political life, utopian discourse can have a significant impact on the change and development of society. (shrink)

Contemporary architecture is increasingly grounded in science and mathematics. Architectural discourse has shifted radically from the sometimes disorienting Derridean deconstruction, to engaging scientific terms such as fractals, chaos, complexity, nonlinearity, and evolving systems. That's where the architectural action is -- at least for cutting-edge architects and thinkers -- and every practicing architect and student needs to become conversant with these terms and know what they mean. Unfortunately, the vast majority of architecture faculty are unprepared to explain them to students, not (...) having had a scientific education themselves. Here is an architecture book by an architect/scientist, just in time to help architects in the new millennium. Alexander discusses many of the scientific terms arising in cutting-edge architecture, and explains them to those who don't have scientific training or advanced mathematical knowledge. We find discussions of the evolution of forms; the importance of process in design; iteration; genetic algorithms; sequences of transformations; different levels of scale (i.e. fractals); etc. They are explained here by an architect who is also a scientist, because he wants to change the way architects think and build. Alexander is not merely popularizing other scientists' results and making them accessible to architects: he is in fact presenting new and original scientific work that ties many of these concepts together in a way that will be useful to architects. (shrink)

The problem of algorithmic structuring of proofs in the sequent calculi LK and LKB ( LK where blocks of quantifiers can be introduced in one step) is investigated, where a distinction is made between linear proofs and proofs in tree form. In this framework, structuring coincides with the introduction of cuts into a proof. The algorithmic solvability of this problem can be reduced to the question of k-l-compressibility: "Given a proof of length k , and l ≤ k : Is (...) there is a proof of length ≤ l ?" When restricted to proofs with universal or existential cuts, this problem is shown to be (1) undecidable for linear or tree-like LK-proofs (corresponds to the undecidability of second order unification), (2) undecidable for linear LKB-proofs (corresponds to the undecidability of semi-unification), and (3) decidable for tree-like LKB -proofs (corresponds to a decidable subprob- lem of semi-unification). (shrink)

Miller (1956) identified his famous limit of 7 ± 2 items based in part on absolute identification—the ability to identify stimuli that differ on a single physical dimension, such as lines of different length. An important aspect of this limit is its independence from perceptual effects and its application across all stimulus types. Recent research, however, has identified several exceptions. We investigate an explanation for these results that reconciles them with Miller’s work. We find support for the hypothesis that the (...) exceptional stimulus types have more complex psychological representations, which can therefore support better identification. Our investigation uses data sets with thousands of observations for each participant, which allows the application of a new technique for identifying psychological representations: the structural forms algorithm of Kemp and Tenenbaum (2008). This algorithm supports inferences not possible with previous techniques, such as multidimensional scaling. (shrink)

One of the predominant debates in AI Ethics is the worry and necessity to create fair, transparent and accountable algorithms that do not perpetuate current social inequities. I offer a critical analysis of Reuben Binns’s argument in which he suggests using public reason to address the potential bias of the outcomes of machine learning algorithms. In contrast to him, I argue that ultimately what is needed is not public reason per se, but an audit of the implicit moral assumptions of (...) societies within which algorithms are built and applied. Public justification is appealing since it offers us the possibility to align the decision-making outcomes of the algorithm with the core moral values of stakeholders within a constitutional democratic society. My concern is that the common moral principles that form the foundation of public reason are not necessarily neutral, as they still express specific moral ideals and normative standards even if there is moral agreement by society as a whole, or among different stakeholders within society. Appealing to such normative standards may thus still lead to algorithmic outcomes being biased as common moral values may very well still be discriminatory even though they are formed from a consensus, and even if public reason is applied as a kind of filter for potential algorithmic outcomes. Hence, I argue that these implicit moral norms within society that we take as a given in public reasoning, need to be audited from generation to generation in order to effectively mitigate potential algorithmic bias. (shrink)

Machine learning algorithms pervade contemporary society. They are integral to social institutions, inform processes of governance, and animate the mundane technologies of daily life. Consistently, the outcomes of machine learning reflect, reproduce, and amplify structural inequalities. The field of fair machine learning has emerged in response, developing mathematical techniques that increase fairness based on anti-classification, classification parity, and calibration standards. In practice, these computational correctives invariably fall short, operating from an algorithmic idealism that does not, and cannot, address systemic, (...) Intersectional stratifications. Taking present fair machine learning methods as our point of departure, we suggest instead the notion and practice of algorithmic reparation. Rooted in theories of Intersectionality, reparative algorithms name, unmask, and undo allocative and representational harms as they materialize in sociotechnical form. We propose algorithmic reparation as a foundation for building, evaluating, adjusting, and when necessary, omitting and eradicating machine learning systems. (shrink)

This paper contributes to debates over algorithmic discrimination with particular attention to structural theories of racism and the problem of “proxy discrimination”—discriminatory effects that arise even when an algorithm has no information about socially sensitive characteristics such as race. Structural theories emphasize the ways that unequal power structures contribute to the subordination of marginalized groups: these theories thus understand racism in ways that go beyond individual choices and bad intentions. Our question is, how should a structural (...) understanding of racism and oppression inform our understanding of algorithmic discrimination and its associated norms? Some responses to the problem of proxy discrimination focus on fairness as a form of “parity,” aiming to equalize metrics between individuals or groups—looking, for example, for equal rates of accurate and inaccurate predictions between one group and another. We argue that from the perspective of structural theories, fairness-as-parity is inapt in the algorithmic context; instead, we should be considering social impact—whether a use of an algorithm perpetuates or mitigates existing social stratification. Our contribution thus offers a new understanding of what algorithmic racial discrimination is. (shrink)

Marx conceives of capitalism as a production mode based on the exploitation of labour-power, whose productive consumption in the labour process is considered as the main source of value creation. Capitalists seek to obscure and secure workers’ contribution to the production process, whereas workers strive to have their contribution fully recognized. The struggle between capitalists and workers over labour-time is thus central to capital’s valorization process. Hence, capital–labour antagonism is structured over the capture and exploitation of unpaid labour-time. Building on (...) Marx’s labour value theory, as well as on some of its contemporary interpretations, I call this struggle over labour-time capture a process of ‘invisibilization’ of labour. I claim that this invisibilization process is still a relevant form of surplus-value extraction in contemporary capitalism, especially in the platform economy, characterized by remote but pervasive control by algorithms. The rediscovery of this form of surplus-value extraction and its manifestation in platform labour is the main contribution of this study. To corroborate this contribution, I compare the case of platform labour with that of textile-clothing, where value production is more clearly based on the classical forms of surplus-value extraction (i.e., absolute and relative). This comparison helps to cast a new light on the nexus between work-process transformations and surplus-value creation, which is the core of the Marxian labour theory of value, and which – I argue – is crucial to understanding contemporary capitalist developments. (shrink)

It is this very contention that sits at the heart of Matthew Flisfeder’s, Algorithmic Desire: Towards a New Structuralist Theory of Social Media (2021). In spite of the accusation that, today, our social media is in fact hampering democracy and subjecting us to increasing forms of online and offline surveillance, for Flisfeder (2021: 3), ‘[s]ocial media remains the correct concept for reconciling ourselves with the structural contradictions of our media, our culture, and our society’. With almost every aspect (...) of our contemporary lives now mediated through the digital, the significance of the algorithm maintains a pertinent importance in making sense of the social and psychic investments that our interactions on social media, as well as other forms of digital media, rely upon and encourage. The socio-political tensions and contradictions that such interaction prescribes remains a reoccurring theme throughout Algorithmic Desire, with Flisfeder masterfully navigating the problems and pitfalls of a burgeoning digital infrastructure that is redefining our lives as social beings. What becomes apparent from Flisfeder’s account is how debates and discussions regarding the algorithm can be couched in a number of pressing concerns, including the proliferation of online misinformation and the contradictions inherent to our freedom and security. While these debates are drawn together through the prism of the algorithm, it is mostly with regards to the medium of social media that Flisfeder examines how our desire and enjoyment are algorithmically organized. This focus is expertly followed throughout the book’s eight chapters, producing a critically engaging inquiry that continually considers the socio-political tensions and ambiguities that frame and sustain our digital media interactions. Ultimately, it is this contention that lends further support to Flisfeder’s assertion that algorithms play a key role in reading our desire. In the discussion that follows, this reading will be critically considered by tracing and outlining a number of key significances underpinning Flisfeder’s approach. Most notably, this will require a discussion of the Lacanian conception of desire; the effects of disavowal and cynical perversion; the importance of ‘maintaining appearances’; and, finally, the significance of the social media metaphor. (shrink)

This paper explores the intersection of René Girard's mimetic theory and the algorithmic society, particularly in the context of the potential advent of Artificial General Intelligence (AGI). Girard's theory, which elucidates the dynamics of desire, rivalry, scapegoating, and the sacrificial crisis, provides a unique lens through which to examine the complexities of our relationship with AI and its role in the creation of the sacred. As individuals increasingly rely on AI recommendations, the distinction between personal choice and algorithmic manipulation becomes (...) less clear, raising concerns about the authenticity of cultural expressions and the role of algorithms in shaping cultural narratives. The triangular structure of desire, with AI as the model and individuals as the imitators, underscores the power of algorithms in this process. The sacrificial crisis, a key concept in Girard's theory, becomes a critical point of reflection in the algorithmic society. The exposure of the scapegoating mechanism reveals the destructive potential of algorithmic manipulation and calls for new forms of understanding, empathy, and non-violent solutions. This paper argues that recognizing the sacrificial crisis can prompt individuals and society to critically examine the impact of AI's influence, challenge the narratives it perpetuates, and reclaim agency in the face of algorithmic dominance. This paper further discusses the potential implications of the emergence of AGI, which could intensify the influence of algorithms on the creation of the sacred due to its advanced cognitive capabilities and deep understanding of human desires and behaviors. This could fuel a rapid evolution of the mimetic ecosystem, with profound implications for personal freedom, independent decision-making, and the formation and preservation of individual identity. This paper concludes by emphasizing the need for responsible algorithmic practices and ethical considerations to ensure that the creation of the sacred serves the common good in the algorithmic society. (shrink)

Well-Structured Mathematical Logic does for logic what Structured Programming did for computation: make large-scale work possible. From the work of George Boole onward, traditional logic was made to look like a form of symbolic algebra. In this work, the logic undergirding conventional mathematics resembles well-structured computer programs. A very important feature of the new system is that it structures the expression of mathematics in much the same way that people already do informally. In this way, the new system is simultaneously (...) machine-parsable and user-friendly, just as Structured Programming is for algorithms. Unlike traditional logic, the new system works with you, not against you, as you use it to structure--and understand--the mathematics you work with on a daily basis. The book provides a complete guide to its subject matter. It presents the major results and theorems one needs to know in order to use the new system effectively. Two chapters provide tutorials for the reader in the new way that symbols move when logical calculations are performed in the well-structured system. Numerous examples and discussions are provided to illustrate the system's many results and features. Well-Structured Mathematical Logic is accessible to anyone who has at least some knowledge of traditional logic to serve as a foundation, and is of interest to all who need a system of pliant, user-friendly mathematical logic to use in their work in mathematics and computer science. (shrink)

The present article reports several applied experiments in the generation of aesthetic forms from algorithms and data. In these experiments algorithms and data are the driving morphogenetic force to such an extent that the role of the human creator must be reexamined case-by-case. Artists that program the graphics or sound generating algorithms may in turn be said to be programmed perceptually by the resulting artworks, in the sense that they must adapt their perception in a conscious or involuntary effort (...) to detect or project meaning in their form. While forms generated by algorithms or data are to a large extent unpredictable, an intimate relationship between programmer, performer/listener/viewer and the piece is created through instinctive, empirical familiarity with the tools and the creative process, which is afforded by the immediate and highly interactive nature of the frameworks employed. A simple iterative algorithm that produces a novel kind of chaotic geometric shapes is presented. Examples of an application of Paul Klee’s principles of visual form in programming interactive audio-visual dance performance are given. These principles are directly derived from the language-based metaphor of active, medial and passive voice. Finally, ongoing experiments in letting language structures emerge from data derived from a sound database are presented. (shrink)

The article analyzes the relation of humans and technology concerning so called ‘intelligent’ or ‘autonomous’ algorithms that are applied in everyday contexts but are far removed from any form of substantial artificial intelligence. In particular, the use of algorithms in surveillance and in architecture is discussed. These examples are structured by a particular combination of continuity and difference between humans and technology. The article provides a detailed analysis of boundary practices that establish continuity and oppositions between humans and information technology, (...) referring to their exemplary depiction in movies. Both strands of boundary practices have the potential to challenge as well as sustain the position of the human as liberal, autonomous subject. Finally, it is shown how the particular combination of continuity and difference that structures the use of algorithms maintains the power of liberal, autonomous subject positions, while the shift of decisions to the algorithms seems to decenter the human. (shrink)

A novel fuzzy control scheme with adaptation algorithms is developed for robot manipulators’ system. At the beginning, one adjustable parameter is introduced in the fuzzy logic system, the robot manipulators system with uncertain nonlinear terms as the master device and a reference model dynamic system as the slave robot system. To overcome the limitations such as online learning computation burden and logic structure in conventional fuzzy logic systems, a parameter should be used in fuzzy logic system, which composes fuzzy logic (...) system with updated parameter laws, and can be formed for a new fashioned adaptation algorithms controller. The error closed-loop dynamical system can be stabilized based on Lyapunov analysis, the number of online learning computation burdens can be reduced greatly, and the different kinds of fuzzy logic systems with fuzzy rules or without any fuzzy rules are also suited. Finally, effectiveness of the proposed approach has been shown in simulation example. (shrink)

The structural-parametric synthesis of neural networks of deep learning, in particular convolutional neural networks used in image processing, is considered. The classification of modern architectures of convolutional neural networks is given. It is shown that almost every convolutional neural network, depending on its topology, has unique blocks that determine its essential features, Residual block, Inception module, ResNeXt block. It is stated the problem of structural-parametric synthesis of convolutional neural networks, for the solution of which it is proposed to (...) use a genetic algorithm. The genetic algorithm is used to effectively overcome a large search space: on the one hand, to generate possible topologies of the convolutional neural network, namely the choice of specific blocks and their locations in the structure of the convolutional neural network, and on the other hand to solve the problem of structural-parametric synthesis of convolutional neural network of selected topology. The most significant parameters of the convolutional neural network are determined. An encoding method is proposed that allows to repre- sent each network structure in the form of a string of fixed length in binary format. After that, several standard genetic operations were identified, i.e. selection, mutation and crossover, which eliminate weak individuals of the previous generation and use them to generate competitive ones. An example of solving this problem is given, a database of patients with thyroid disease was used as a training sample. (shrink)

The paper studies the logic TL(NBox+-wC) – logic of discrete linear time with current time point clusters. Its language uses modalities Diamond+ (possible in future) and Diamond- (possible in past) and special temporal operations, – Box+w (weakly necessary in future) and Box-w (weakly necessary in past). We proceed by developing an algorithm recognizing theorems of TL(NBox+-wC), so we prove that TL(NBox+-wC) is decidable. The algorithm is based on reduction of formulas to inference rules and converting the rules in (...) special reduced normal form, and, then, on checking validity of such rules in models of singleexponential size in the rules. Also we consider the admissibility problem for TL(NBox+-wC) and show how to reduce the problem for admissibility to the decidability of TL(NBox+-wC) itself using definable universal modalities. (shrink)

The purpose of the study is to investigate the features of the algorithm for forming the stock portfolio of investors using the theory of fuzzy sets, taking into account a priori uncertain input information and market dynamics. The scientific novelty of the article lies in the application of a relatively new fuzzy-multiple apparatus and the theory of fuzzy sets to the formation of the stock portfolio of investors. From a practical point of view, the proposed fuzzy model makes it (...) possible to predict not only the structure and expected return of a portfolio of securities, similarly to the application of the classical portfolio theory, but also to obtain the values of the lower and upper boundaries of the return on securities, which will allow the investor to form a more complete picture of the structure of the portfolio in the future. As a result, it was found that the use of classical statistical approaches for the formation of a stock portfolio of investors will not allow obtaining a reliable and accurate result, since traditional methods do not take into account the uncertainty factors of events in the stock market. To level information asymmetry and eliminate risks of uncertainty, it is advisable to apply the theory of fuzzy logic. (shrink)

To optimize the weak robustness of traditional face recognition algorithms, the classification accuracy rate is not high, the operation speed is slower, so a face recognition algorithm based on local binary pattern and stacked autoencoder is proposed. The advantage of LBP texture structure feature of the face image as the initial feature of sparse autoencoder learning, use the unified mode LBP operator to extract the histogram of the blocked face image, connect to form the LBP features of the entire (...) image. It is used as input of the stacked AE, feature extraction is done, realize the recognition and classification of face images. Experimental results show that the recognition rate of the algorithm LBP-SAE on the Yale database has achieved 99.05%, and it further shows that the algorithm has a higher recognition rate than the classic face recognition algorithm; it has strong robustness to light changes. Experimental results on the Olivetti Research Laboratory library shows that the developed method is more robust to light changes and has better recognition effects compared to traditional face recognition algorithms and standard stack AEs. (shrink)

The input data to grammar learning algorithms often consist of overt forms that do not contain full structural descriptions. This lack of information may contribute to the failure of learning. Past work on Optimality Theory introduced Robust Interpretive Parsing (RIP) as a partial solution to this problem. We generalize RIP and suggest replacing the winner candidate with a weighted mean violation of the potential winner candidates. A Boltzmann distribution is introduced on the winner set, and the distribution’s parameter (...) $T$ is gradually decreased. Finally, we show that GRIP, the Generalized Robust Interpretive Parsing Algorithm significantly improves the learning success rate in a model with standard constraints for metrical stress assignment. (shrink)

Previous research has demonstrated how emotion resembling cues in the face help shape impression formation. Perhaps most notable in the literature to date, has been work suggesting that gender-related appearance cues are visually confounded with certain stereotypic expressive cues. Only a couple studies to date have used computer vision to directly map out and test facial structural resemblance to emotion expressions using facial landmark coordinates to estimate face shape. In one study using a Bayesian network classifier trained to detect (...) emotional expressions structural resemblance to a specific expression on a non-expressive face was found to influence trait impressions of others. In another study, a connectionist model trained to detect emotional expressions found different emotion-resembling cues in male vs. female faces. Despite this seminal work, direct evidence confirming the theoretical assertion that humans likewise utilize these emotion-resembling cues when forming impressions has been lacking. Across four studies, we replicate and extend these prior findings using new advances in computer vision to examine gender-related, emotion-resembling structure, color, and texture and their impact on gender-stereotypic impression formation. We show that all three are meaningfully related to human impressions of emotionally neutral faces. Further when applying the computer vision algorithms to experimentally manipulate faces, we show that humans derive similar impressions from them as did the computer. (shrink)

Fractal art graphics are the product of the fusion of mathematics and art, relying on the computing power of a computer to iteratively calculate mathematical formulas and present the results in a graphical rendering. The selection of the initial value of the first iteration has a greater impact on the final calculation result. If the initial value of the iteration is not selected properly, the iteration will not converge or will converge to the wrong result, which will affect the accuracy (...) of the fractal art graphic design. Aiming at this problem, this paper proposes an improved optimization method for selecting the initial value of the Gauss-Newton iteration method. Through the area division method of the system composed of the sensor array, the effective initial value of iterative calculation is selected in the corresponding area for subsequent iterative calculation. Using the special skeleton structure of Newton’s iterative graphics, such as infinitely finely inlaid chain-like, scattered-point-like composition, combined with the use of graphic secondary design methods, we conduct fractal art graphics design research with special texture effects. On this basis, the Newton iterative graphics are processed by dithering and MATLAB-based mathematical morphology to obtain graphics and then processed with the help of weaving CAD to directly form fractal art graphics with special texture effects. Design experiments with the help of electronic Jacquard machines proved that it is feasible to transform special texture effects based on Newton's iterative graphic design into Jacquard fractal art graphics. (shrink)

It is exhibited that mature scientific economical theory is a set of propositions that describe the relationship between theoretical objects of two types - basic objects and derivative ones. The set of basic objects makes up the aggregate of initial idealizations (the Fundamental Theoretical Scheme or FTS) with no direct reference to experimental data. The derivative theoretical objects are formed from the basic ones according to certain rules. The sets of derivative objects form partial theoretical schemes or PTS. Any mature (...) economics scientific theory grows due to transitions, in order to describe each new experimental situation, from FTS to PTS. Each PTS construction from the FTS represents a problem that cannot be reduced to a strict algorithm. (shrink)

BackgroundAs the use of AI becomes more pervasive, and computerised systems are used in clinical decision-making, the role of trust in, and the trustworthiness of, AI tools will need to be addressed. Using the case of computational phenotyping to support the diagnosis of rare disease in dysmorphology, this paper explores under what conditions we could place trust in medical AI tools, which employ machine learning.MethodsSemi-structured qualitative interviews with stakeholders who design and/or work with computational phenotyping systems. The method of constant (...) comparison was used to analyse the interview data.ResultsInterviewees emphasized the importance of establishing trust in the use of CP technology in identifying rare diseases. Trust was formulated in two interrelated ways in these data. First, interviewees talked about the importance of using CP tools within the context of a trust relationship; arguing that patients will need to trust clinicians who use AI tools and that clinicians will need to trust AI developers, if they are to adopt this technology. Second, they described a need to establish trust in the technology itself, or in the knowledge it provides—epistemic trust. Interviewees suggested CP tools used for the diagnosis of rare diseases might be perceived as more trustworthy if the user is able to vouchsafe for the technology’s reliability and accuracy and the person using/developing them is trusted.ConclusionThis study suggests we need to take deliberate and meticulous steps to design reliable or confidence-worthy AI systems for use in healthcare. In addition, we need to devise reliable or confidence-worthy processes that would give rise to reliable systems; these could take the form of RCTs and/or systems of accountability transparency and responsibility that would signify the epistemic trustworthiness of these tools. words 294. (shrink)

Traditionally, philosophers have focused mostly on the logical template of inference. The paradigm-case has been deductive inference, which is topic-neutral and context-insensitive. The study of deductive rules has engendered the search for the Holy Grail: syntactic and topic-neutral accounts of all prima facie reasonable inferential rules. The search has hoped to find rules that are transparent and algorithmic, and whose following will just be a matter of grasping their logical form. Part of the search for the Holy Grail has been (...) to show that the so-called scientific method can be formalised in a topic-neutral way. We are all familiar with Carnap’s inductive logic, or Popper’s deductivism or the Bayesian account of scientific method. (shrink)

ABSTRACT Most theorem provers for Classical Logic transform the input formula into a particular normal form. This tranformation is done before the execution of the algorithm or it is integrated into the deductive algorithm. This situation is no different for Non-Classical Logics and, particularly, for Temporal Logics. However, unlike classical logic, temporal logic does not provide an extension of the notion of non negative normal form. In this work, we define a temporal negative normal form for the future (...) fragment of the linear time propositional temporal logic, named FNext. The definition saves as much information as possible about implicants and implicates of the input formula and its subformulas. This property is the novelty of this normal form; for example, in [Fis97] the normal form is guided by the separation property and in [Ven86] the normal form provided prepares the input formula to be treated by a resolution method. Moreover, we also introduce an algorithm having linear cost, which transforms the input formula into a temporal negative normal form. Furthermore, in this work we present a new structure and a set of operators over it that allows us to efficiently manage the information about unitary implicants and implicates contained in the subformulae. (shrink)

After the novel, and subsequently cinema privileged narrative as the key form of cultural expression of the modern age, the computer age introduces its correlate — database. Why does new media favour database form over others? Can we explain ist popularity by analysing the specificity of the digital medium and of computer programming? What is the relationship between database and another form, which has traditionally dominated human culture — narrative? In addressing these questions, I discuss the connection between computer's ontology (...) — the way software represents the world — and the new cultural forms privileged by computer culture such as database. I propose that computerisation of culture involves projection of two fundamental parts of computer software — data structures and algorithms — onto the cultural sphere. Thus CD-ROMs and Web databases are cultural manifestations of one half of this ontology — data structures; while new media narratives are manifestations of the second part — algorithms. I conclude by proposing that in computer culture database and narrative do not have the same status. Given that on the level of data organisation most new media objects are databases, it is not surprising that on the level of form database also dominates new media culture. (shrink)

Probabilistic predictions of future risk govern much of society: healthcare, genetics, social media, national security, and finance. Both policy-makers and private companies are increasingly working to design institutional structures that seek to manage risk by controlling the behavior of citizens and consumers, using new technologies of predictive control that comb through past data to predict and shape future action. These predictions not only control social institutions but also shape individual character and forms of practical reason. Risk-based decision theory shifts (...) people's relationships to the future through knowledge of possible dangers and foregone opportunities, thus inspiring anxious solicitude and deceptive hopes for total security. This book uses virtue ethics to analyze these problems and to suggest ways to enjoy these technologies' positive benefits while constraining their dangerous aspects through a better understanding of practical reasoning and a theological analysis of our responsibility for future risks. (shrink)

The logic L (Qu) extends first-order logic by a generalized form of counting quantifiers ("the number of elements satisfying... belongs to the set C"). This logic is investigated for structures with an injectively ω-automatic presentation. If first-order logic is extended by an infinity-quantifier, the resulting theory of any such structure is known to be decidable [6]. It is shown that, as in the case of automatic structures [21], also modulo-counting quantifiers as well as infinite cardinality quantifiers ("there are χ many (...) elements satisfying...") lead to decidable theories. For a structure of bounded degree with injective ω-automatic presentation, the fragment of L(Qu) that contains only effective quantifiers is shown to be decidable and an elementary algorithm for this decision is presented. Both assumptions (ω-automaticity and bounded degree) are necessary for this result to hold. (shrink)

We study active set methods for optimization problems in Block Angular Form (BAF). We begin by reviewing some standard basis factorizations, including Saunders' orthogonal factorization and updates for the simplex method that do not impose any restriction on the pivot sequence and maintain the basis factorization structured in BAF throughout the algorithm. We then suggest orthogonal factorization and updating procedures that allow coarse grain parallelization, pivot updates local to the affected blocks, and independent block reinversion. A simple parallel environment (...) appropriate to the description and complexity analysis of test procedures is defined in Section 5. The factorization and updating procedures are presented in Sections 6 and 7. Our update procedure outperforms conventional Updating procedures even in a purely sequential environment. (shrink)

Recently, two apparently quite different duality-based approaches to automata minimisation have appeared. One is based on ideas that originated from the controllability-observability duality from systems theory, and the other is based on ideas derived from Stone-type dualities specifically linking coalgebras with algebraic structures derived from modal logics. In the present paper, we develop a more abstract view and unify the two approaches. We show that dualities, or more generally dual adjunctions, between categories can be lifted to dual adjunctions between categories (...) of coalgebras and algebras, and from there to automata with initial as well as final states. As in the Stone-duality approach, algebras are essentially logics for reasoning about the automata. By exploiting the ability to pass between these categories, we show that one can minimize the corresponding automata. We give an abstract minimisation algorithm that has several instances, including the celebrated Brzozowski minimisation algorithm. We further develop three examples that have been treated in previous works: deterministic Kripke frames based on a Stone-type duality, weighted automata based on the self-duality of semimodules, and topological automata based on Gelfand duality. As a new example, we develop alternating automata based on the discrete duality between sets and complete atomic Boolean algebras. (shrink)

Although formal thought disorder (FTD) has been for long a clinical label in the assessment of some psychiatric disorders, in particular of schizophrenia, it remains a source of controversy, mostly because it is hard to say what exactly the “formal” in FTD refers to. We see anomalous processing of terminological knowledge, a core construct of human knowledge in general, behind FTD symptoms and we approach this anomaly from a strictly formal perspective. More specifically, we present here a symbolic computational model (...) of storage in, and activation of, a human semantic network, or semantic memory, whose core element is logical form; this is normalized by description logic (DL), namely by CL, a DL-based language – Conception Language – designed to formalize conceptualization from the viewpoint of individual cognitive agency. In this model, disruptions in the rule-based implementation of the logical form account for the apparently semantic anomalies symptomatic of FTD, which are detected by means of a CL-based algorithmic assessment. (shrink)

In previous works we have established that the spacetime probabilistic organization of the quantum theory is determined by the spacetime characteristics of the operations by which the observer produces the objects to be studied (“states” of microsystems) and obtains qualifications of these. Guided by this first conclusion, we have then built a “general syntax of relativized conceptualization” where any description is explicitly and systematically referred to the two basic epistemic operations by which the conceptor introduces the object to be qualified (...) and then obtains qualifications of it. Inside this syntax there emerges a general typology of the relativized descriptions. Here we show that with respect to this typology the type of the predictive quantum mechanical descriptions acquires a precise definition. It appears that the quantum mechanical formalism has captured and has expressed directly in a mathematical language the most complex form in which can occur a first descriptional phase that lies universally at the bottom of any chain of conceptualization. The main features of the Hilbert-Dirac algorithms are decoded in terms of the general syntax of relativized conceptualization. This renders explicit the semantical contents of the quantum mechanical representations relating each one of these to its mathematical quantum mechanical expression. Basic insufficiencies are thus identified and, correlatively, false problems as well as answers to these, or guides toward answers. Globally the results obtained provide a basis for future attempts at a general mathematical representation of the processes of conceptualization. “Il pourrait, en effet, être dangereux pour l'avenir de la Physique qu'elle se contente trop facilement de purs formalismes, d'images floues et d'explications toutes verbales s'exprimant par des mots à signification imprécise”—Louis de Broglie,Certitudes et Incertitudes de la Science (Albin Michel, Paris, 1965). (shrink)

A method is described for inducing a type-logical grammar from a sample of bare sentence trees which are annotated by lambda terms, called term-labelled trees . Any type logic from a permitted class of multimodal logics may be specified for use with the procedure, which induces the lexicon of the grammar including the grammatical categories. A first stage of semantic bootstrapping is performed, which induces a general form lexicon from the sample of term-labelled trees using Fulop’s (J Log Lang Inf (...) 14(1):49–86, 2005) procedure. Next we present a two-stage procedure for performing distributional learning by unifying the lexical types that are initially discovered. The first structural unification algorithm in essence unifies the initial family of sets of types so that the resulting grammar will generate all term-labelled trees that follow the usage patterns evident from the learning sample. Further altering the lexical categories to generate a recursively extended language can be accomplished by a second unification. The combined unification algorithm is shown to yield a new type-logical lexicon that extends the learning sample to a possibly infinite (and possibly context-sensitive) language in a principled fashion. Finally, the complete learning strategy is analyzed from the perspective of algorithmic learning theory; the range of the procedure is shown to be a class of term-labelled tree languages which is finitely learnable from good examples (Lange et al in Algorithmic learning theory, Vol 872 of lecture notes in artificial intelligence, Springer, Berlin, pp 423–437), and so is identifiable in the limit as a corollary. (shrink)

How should we share the truth about the environmental crisis? At a moment when even the most basic facts about ecology and the climate face contestation and contempt, environmental advocates are at an impasse. Many have turned to social media and digital technologies to shift the tide-but what if their strategy is not only flawed, but dangerous? The Truth about Nature follows environmental actors as they turn to the internet to save nature. It documents how conservation efforts are transformed through (...) the political economy of platforms and the algorithmic feeds that have been instrumental to the rise of post-truth politics. Developing a novel account of post-truth as an expression of power under platform capitalism, Bram Büscher shows how environmental actors attempt to mediate between structural forms of platform power and the contingent histories and contexts of particular environmental issues. Bringing efforts at wildlife protection in Southern Africa into dialogue with a sweeping analysis of truth and power in the twenty-first century, Büscher makes the case for a new environmental politics: one that radically reignites the art of speaking truth to power. (shrink)

Based on the adaptive particle swarm algorithm and error backpropagation neural network, this paper proposes methods for different styles of music classification and migration visualization. This method has the advantages of simple structure, mature algorithm, and accurate optimization. It can find better network weights and thresholds so that particles can jump out of the local optimal solutions previously searched and search in a larger space. The global search uses the gradient method to accelerate the optimization and control the (...) real-time generation effect of the music style transfer, thereby improving the learning performance and convergence performance of the entire network, ultimately improving the recognition rate of the entire system, and visualizing the musical perception. This kind of real-time information visualization is an artistic expression form, in which artificial intelligence imitates human synesthesia, and it is also a kind of performance art. Combining traditional music visualization and image style transfer adds specific content expression to music visualization and time sequence expression to image style transfer. This visual effect can help users generate unique and personalized portraits with music; it can also be widely used by artists to express the relationship between music and vision. The simulation results show that the method has better classification performance and has certain practical significance and reference value. (shrink)

“Our impartiality is kept for abstract merit and demerit, which none of us ever saw.” -George Eliot, Middlemarch,book 4, chap. 40, 1871.Naturalized epistemology, as I understand it, is the practice of treating knowledge – human or otherwise – as a natural phenomenon, susceptible of investigation by the methods of empirical science. A naturalized approach to the study of knowledge differs saliently from more traditional forms of epistemology in taking the existence of knowledge for granted. Naturalized epistemologists do not concern (...) themselves with skeptical challenges. Nor are naturalized epistemologists much concerned with questions about what counts as “knowledge,” properly speaking. They do not worry if a bird’s natively specified program for star-based navigation is “justified” for the bird, nor if the sub-personal data structures and algorithms posited by cognitive psychologists can be properly counted as “beliefs.” The naturalized epistemologist is interested in the explanation of anything that even appears to be a cognitive achievement, whether or not it passes muster as “knowledge” in some preferred sense. (shrink)

The omnipresence of the same basic equations, function forms, algorithms, and quantitative methods is one of the most spectacular characteristics of contemporary modeling practice. Recently, the emergence of the discussion of templates and template transfer has addressed this striking cross-disciplinary reach of certain mathematical forms and computational algorithms. In this paper, we develop a notion of a model template, consisting of its mathematical structure, ontology, prototypical properties and behaviors, focal conceptualizations, and the paradigmatic questions it addresses. We apply (...) this notion to three widely disseminated and powerful model templates: the Sherrington-Kirkpatrick model of spin glasses, scale-free networks, and the Kuramoto model of synchronization. We argue that what appears to be an interdisciplinary model transfer between different domains turns out, from a broader perspective, to be the application of transdisciplinary model templates across a multitude of domains. We also point out a further feature of template-based modeling that so far has not been discussed: template entanglement. Such entanglement enhances and makes manifest the conceptual side of model templates. (shrink)

This book explains exactly what human knowledge is. The key concepts in this book are structures and algorithms, i.e., what the readers “see” and how they make use of what they see. Thus in comparison with some other books on the philosophy of science, which employ a syntactic approach, the author’s approach is model theoretic or structural. Properly understood, it extends the current art and science of mathematical modeling to all fields of knowledge. The link between structure and algorithms (...) is mathematics. But viewing “mathematics” as such a link is not exactly what readers most likely learned in school; thus, the task of this book is to explain what “mathematics” should actually mean. Chapter 1, an introductory essay, presents a general analysis of structures, algorithms and how they are to be linked. Several examples from the natural and social sciences, and from the history of knowledge, are provided in Chapters 2–6. In turn, Chapters 7 and 8 extend the analysis to include language and the mind. Structures are what the readers see. And, as abstract cultural objects, they can almost always be seen in many different ways. But certain structures, such as natural numbers and the basic theory of grammar, seem to have an absolute character. Any theory of knowledge grounded in human culture must explain how this is possible. The author’s analysis of this cultural invariance, combining insights from evolutionary theory and neuroscience, is presented in the book’s closing chapter. The book will be of interest to researchers, students and those outside academia who seek a deeper understanding of knowledge in our present-day society. (shrink)

In this paper, we investigate the constitutive problems and other several aspects of what a research entitled 'formal epistemology' should be. The interest in this subject has to do with the possibility of reaching a privileged point of view or axis of research - i.e., the 'formal' one - that would allow, a better grasp of the richness and variety of the facts and problems tackled by precise (local) epistemology of theories (for example, in physics). This approach is likely to (...) enable one to hold the main structural lines that organize those theories according to a more com prehensive, unifying and synthetic intelligibilit. By the same token, it would eventually allow a better handling of the changes required in the organization of knowledge, putting emphasis on its main directions, drawing up a rational inventory of this knowledge, and perhaps anticipating others. At first, we deal with the `thought of changes' that no approach of the 'form' can afford to leave aside, since the meaning of this concept is inseparable from the contents that come with constructions and modifications. We examine then the notion of 'epistemic operation' as an instrument to create new forms on the theoretical as well as on the meta-theoretical levels. ln the wake of it, we analyze the characteristics of the form and of the formal, as well as their relationship with the contents of knowledge. We also take the notion of object into account, since it depends upon the decision of a subject and upon conventional choices. We finally inquire about the link between `epistemic operations' as specified above and algorithmic functions for knowledge statements, and emphasize the risk of reductionism that might follow from a naturalistic conception of representation. (shrink)

This book collects eight essays — written over multiple decades, for a general audience — that address Fenstad’s thoughts on the topics of what there is and how.

Algorithmically driven online dating platforms today promise the ability to sort through relevant data and identify one’s ideal amorous matches effectively. Yet the appeal of technological and scientific solutions to the messy problem of finding partners is hardly new. This introduction to the Focus section “It’s a Match!” argues that the history of amorous matching has long been part and parcel of the history of science, in particular the social sciences. Taking matching as an “applied science of social harmony,” the (...) authors argue that concern over more reliable techniques for determining the suitability of partners has formed an essential part of both the maintenance of social order and the shaping of subjectivities, enabling discourses of informed choice and the rational management of the passions, while also reinforcing and subverting structures of age, gender, race, and sexuality. (shrink)

One of the most efficient nondestructive methods for pipeline in-line inspection is magnetic flux leakage inspection. Estimating the size of the defect from MFL signal is one of the key problems of MFL inspection. As the inspection signal is usually contaminated by noise, sizing the defect is an ill-posed inverse problem, especially when sizing the depth as a complex shape. An actor-critic structure-based algorithm is proposed in this paper for sizing complex depth profiles. By learning with more information from (...) the depth profile without knowing the corresponding MFL signal, the algorithm proposed saves computational costs and is robust. A pinning strategy is embedded in the reconstruction process, which highly reduces the dimension of action space. The pinning actor-critic structure helps to make the reward for critic network more efficient when reconstructing the depth profiles with high degrees of freedom. A nonlinear FEM model is used to test the effectiveness of algorithm proposed under 20 dB noise. The results show that the algorithm reconstructs the depth profile of defects with good accuracy and is robust against noise. (shrink)

Algorithms for NLG NLG is typically broken down into stages of discourse planning (to select information and organize it into coherent paragraphs), sentence planning (to choose words and structures to fit information into sentence-sized units), and realization (to determine surface form of output, including word order, morphology and final formatting or intonation). The SPUD system combines the generation steps of sentence planning and surface realization by using a lexicalized grammar to construct the syntax and semantics of a sentence simultaneously.

Mechanism design is a form of optimization developed in economic theory. It casts economists as institutional engineers, choosing an outcome and then arranging a set of market rules and conditions to achieve it. The toolkit from mechanism design is widely used in economics, policymaking, and now in building and managing online environments. Mechanism design has become one of the most pervasive yet inconspicuous influences on the digital mediation of social life. Its optimizing schemes structure online advertising markets and other multi-sided (...) platform businesses. Whatever normative rationales mechanism design might draw on in its economic origins, as its influence has grown and its applications have become more computational, we suggest those justifications for using mechanism design to orchestrate and optimize human interaction are losing traction. In this article, we ask what ideological work mechanism design is doing in economics, computer science, and its applications to the governance of digital platforms. Observing mechanism design in action in algorithmic environments, we argue it has become a tool for producing information domination, distributing social costs in ways that benefit designers, and controlling and coordinating participants in multi-sided platforms. (shrink)

That every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor easily found in the literature. Various approaches to the result are presented and discussed in detail, including one inspired by a problem in the proof theory of intermediate logics that led us to the proof of the present paper. It can (...) be seen as a modification of Skolem’s argument from 1920 for his “Normal Form” theorem. “Geometric” being the infinitary version of “coherent”, it is further shown that every infinitary first-order theory, suitably restricted, has a geometric conservative extension, hence the title. The results are applied to simplify methods used in reasoning in and about modal and intermediate logics. We include also a new algorithm to generate special coherent implications from an axiom, designed to preserve the structure of formulae with relatively little use of normal forms. (shrink)

In this paper, a formal theory is presented that describes syntactic and semantic mechanisms of philosophical discourses. They are treated as peculiar language systems possessing deep derivational structures called architectonic forms of philosophical systems, encoded in philosophical mind. Architectonic forms are constituents of more complex structures called architectonic spaces of philosophy. They are understood as formal and algorithmic representations of various philosophical traditions. The formal derivational machinery of a given space determines its class of all possible architectonic (...) class='Hi'>forms. Some of them stand under factual historical philosophical systems and they organize processes of doing philosophy within these systems. Many architectonic forms have never been realized in the history of philosophy. The presented theory may be interpreted as falling under Hegel’s paradigm of comprehending cultural texts. This paradigm is enriched and inspired with Propp’s formal, morphological view on texts. The peculiarity of this modification of the Hegel-Propp paradigm consists of the use of algebraic and algorithmic tools of modeling processes of cultural development. To speak metaphorically, the theory is an attempt at the mathematical and logical history of philosophy inspired by the Internet metaphor. And that is why it belongs to the tradition of doing metaphilosophy in The Lvov-Warsaw School, which is continued today mainly by Woleński, Pelc, Perzanowski, and Jadacki. (shrink)

Knowledge of the structure of ancestral genomes provides the basis of a new framework to better represent and interpret results from genomic and evolutionary studies. Because these ancestors lived tens of hundreds of million years ago, this knowledge will inevitably take the form of abstract representations, reconstructed on the basis both of experimental evidence collected on extant genomes and of our understanding of evolutionary processes. This is the field of Paleogenomics, a young discipline that is providing an increasingly precise picture (...) of our ancestral vertebrate genomes based on cytogenetic data, genome sequences and new algorithmic developments. Many recent studies have focused on the ancestral placental mammal and teleost fish genomes, although the outlines of even more distant pre‐vertebrate ancestors are being reported. BioEssays 30:122–134, 2008. © 2008 Wiley Periodicals, Inc. (shrink)

How can anyone be rational in a world where knowledge is limited, time is pressing, and deep thought is often an unattainable luxury? Traditional models of unbounded rationality and optimization in cognitive science, economics, and animal behavior have tended to view decision-makers as possessing supernatural powers of reason, limitless knowledge, and endless time. But understanding decisions in the real world requires a more psychologically plausible notion of bounded rationality. In Simple heuristics that make us smart (Gigerenzer et al. 1999), we (...) explore fast and frugal heuristics – simple rules in the mind's adaptive toolbox for making decisions with realistic mental resources. These heuristics can enable both living organisms and artificial systems to make smart choices quickly and with a minimum of information by exploiting the way that information is structured in particular environments. In this précis, we show how simple building blocks that control information search, stop search, and make decisions can be put together to form classes of heuristics, including: ignorance-based and one-reason decision making for choice, elimination models for categorization, and satisficing heuristics for sequential search. These simple heuristics perform comparably to more complex algorithms, particularly when generalizing to new data – that is, simplicity leads to robustness. We present evidence regarding when people use simple heuristics and describe the challenges to be addressed by this research program. Key Words: adaptive toolbox; bounded rationality; decision making; elimination models; environment structure; heuristics; ignorance-based reasoning; limited information search; robustness; satisficing; simplicity. (shrink)

This article synthesizes the current theoretical attempts to understand human-machine interactions and introduces seven premises to understand our emerging dynamics with increasingly competent, pervasive, and instantly accessible algorithms. The hope that these seven premises can build toward a social theory of human-AI cocreation. The focus on human-AI cocreation is intended to emphasize two factors. First, is the fact that our machine learning systems are socialized. Second, is the coevolving nature of human mind and AI systems as smart devices form an (...) indispensable part of our cognitive scaffolds, thus, shaping how we perceive the world and ourselves. The seven premises include: primacy of social structures; human’s desire for freedom and autonomy; AI systems will form inseparable parts of our cognitive/affective scaffolds and can change our self-understanding; philosophy and humanistic foundations on human flourishing as a guide to human-AI interaction; mindsponge information-filtering process; acculturative process of how values change and emerge from human-AI interaction; overlapping Venn diagram of the human-human, human-nature, and human-machine interactions. This article concludes with a discussion on human agency in our entanglements with socialized machines and the illusoriness of the Cartesian agent view of the mind. (shrink)