In the study of rational solutions to polynomial equations in two-variables, we show that an algorithmic solution to the decision problem (existence of solutions) enables one to construct a search algorithm for all solutions.

Mental health is an important basic condition for college students to become adults. Educators gradually attach importance to strengthening the mental health education of college students. This paper makes a detailed analysis and research on college students’ mental health, expounds the development and application of clustering analysis algorithm, applies the distance formula and clustering criterion function commonly used in clustering analysis, and makes a specific description of some classic algorithms of clustering analysis. Based on expounding the advantages and disadvantages (...) of fast-clustering analysis algorithm and hierarchical clustering analysis algorithm, this paper introduces the concept of the two-step clustering algorithm, discusses the algorithm flow of clustering model in detail, and gives the algorithm flow chart. The main work of this paper is to analyze the clustering algorithm of students’ mental health database formed by mental health assessment tool test, establish a data mining model, mine the database, analyze the state characteristics of different college students’ mental health, and provide corresponding solutions. In order to meet the needs of the psychological management system based on the clustering analysis method, the clustering analysis algorithm is used to cluster the data. Based on the original database, this paper establishes the methods of selecting, cleaning, and transforming the data of students’ psychological archives. Finally, it expounds on the application of data mining in students’ psychological management system and summarizes and prospects the implementation of the system. (shrink)

Frequent pattern mining is an effective approach for spatiotemporal association analysis of mobile trajectory big data in data-driven intelligent transportation systems. While existing parallel algorithms have been successfully applied to frequent pattern mining of large-scale trajectory data, two major challenges are how to overcome the inherent defects of Hadoop to cope with taxi trajectory big data including massive small files and how to discover the implicitly spatiotemporal frequent patterns with MapReduce. To conquer these challenges, this paper presents a MapReduce-based Parallel (...) Frequent Pattern growth algorithm to analyze the spatiotemporal characteristics of taxi operating using large-scale taxi trajectories with massive small file processing strategies on a Hadoop platform. More specifically, we first implement three methods, that is, Hadoop Archives, CombineFileInputFormat, and Sequence Files, to overcome the existing defects of Hadoop and then propose two strategies based on their performance evaluations. Next, we incorporate SF into Frequent Pattern growth algorithm and then implement the optimized FP-growth algorithm on a MapReduce framework. Finally, we analyze the characteristics of taxi operating in both spatial and temporal dimensions by MR-PFP in parallel. The results demonstrate that MR-PFP is superior to existing Parallel FP-growth algorithm in efficiency and scalability. (shrink)

It is amazing to see how many webpages are devoted to the art of finding the date of Easter Sunday. Just for illustration, the reader may search for terms such as Gregorian calendar, date of Easter, or Easter algorithm. Sophisticated essays as well as less enlightening contributions are presented, and many a doubt is expressed about the reliability of some results obtained with some Easter algorithms. In short, there is still a great interest in those problems. Gregorian Easter algorithms (...) exist for two centuries (or more?), but most of their history is rather obscure. Some reasons may be that some important sources are written in Latin or in the German of Goethe’s time, or they are difficult to discover. Without being complete, the following paper is intended to shed light on how those techniques emerged and evolved.1 Like a microcosm, the history of Easter algorithms resembles the history of any science: it is a story of trials, errors, and successes, and, last but not least, a story of offended pride. (shrink)

Neurological Positivism’s single- and two-neuro-algorithmic referent conceptions of subjective and objective experience respectively are discussed. NP’s account of Bohr and Heisenberg’s Copenhagen interpretation of quantum reality is then described in terms of nonlinear constructions of two-neuro-algorithmic referents that are proposed also to undergird William James’s pragmatic conception of truth. In turn, qualia are depicted as nonlinear single-neuro-algorithmic referents in relation to the two-neuro-algorithmic quantum measurement procedure. Experientially, qualia are described as nonlinear "black twinkling" neuro-flux patterns which in the context of (...) overall brain organization in both phylogeny and ontogeny increase the brain’s probability of survival. It is concluded that ontological questions are really about the relationships between the two-neuro-algorithmic referent systems in the brain, and the quantum theoretical measurement procedure is the best "test" of NP’s two-neuro-algorithmic hypothesis and, as a test, greatly alters the traditional interpretation of Bell’s theorem. (shrink)

Multiobjective evolutionary algorithms have witnessed prosperity in solving many-objective optimization problems over the past three decades. Unfortunately, no one single MOEA equipped with given parameter settings, mating-variation operator, and environmental selection mechanism is suitable for obtaining a set of solutions with excellent convergence and diversity for various types of MaOPs. The reality is that different MOEAs show great differences in handling certain types of MaOPs. Aiming at these characteristics, this paper proposes a flexible ensemble framework, namely, ASES, which is highly (...) scalable for embedding any number of MOEAs to promote their advantages. To alleviate the undesirable phenomenon that some promising solutions are discarded during the evolution process, a big archive that number of contained solutions be far larger than population size is integrated into this ensemble framework to record large-scale nondominated solutions, and also an efficient maintenance strategy is developed to update the archive. Furthermore, the knowledge coming from updating archive is exploited to guide the evolutionary process for different MOEAs, allocating limited computational resources for efficient algorithms. A large number of numerical experimental studies demonstrated superior performance of the proposed ASES. Among 52 test instances, the ASES performs better than all the six baseline algorithms on at least half of the test instances with respect to both metrics hypervolume and inverted generational distance. (shrink)

As more decisions are made by automated algorithmic systems, the transparency of these systems has come under scrutiny. While such transparency is typically seen as beneficial, there is a also a critical, Foucauldian account of it. From this perspective, worries have recently been articulated that algorithmic transparency can be used for manipulation, as part of a disciplinary power structure. Klenk (Philosophy & Technology 36, 79, 2023) recently argued that such manipulation should not be understood as exploitation of vulnerable victims, but (...) rather as indifference to whether the information provided enhances decision-making by revealing reasons. This short commentary on Klenk uses Berlin’s (1958) two concepts of liberty to further illuminate the concept of transparency as manipulation, finding alignment between positive liberty and the critical account. (shrink)

Scholars of critical algorithmic studies, including those from geography, anthropology, Science and Technology Studies and communication studies, have begun to consider how algorithmic devices and platforms facilitate democratic practices. In this article, I draw on a comparative ethnography of two alternative open-source algorithmic platforms – Decide Madrid and vTaiwan – to consider how they are dynamically constituted by differing algorithmic–human relationships. I compare how different algorithmic–human relationships empower citizens to influence political decision-making through proposing, commenting, and voting on the urban (...) issues that should receive political resources in Taipei and Madrid. I argue that algorithmic empowerment is an emerging process in which algorithmic–human relationships orient away from limitations and towards conditions of plurality, actionality, and power decentralisation. This argument frames algorithmic empowerment as bringing about empowering conditions that allow (underrepresented) individuals to shape policy-making and consider plural perspectives for political change and action, not as an outcome-driven, binary assessment (i.e. yes/no). This article contributes a novel, situated, and comparative conceptualisation of algorithmic empowerment that moves beyond technological determinism and universalism. (shrink)

The author describes two outstanding moments in his work with Russell’s archives, over a period of 52 years, from readying them for sale in London to curating them at McMaster University. The highlights were being hired for the Russell Archives at McMaster and adoption of the correspondence catalogue by the University Library from its maintenance and development as a post-retirement project.

Maps and territory suggest problems which have to do with the opening of pathways in some poorly explored domain.

Should decision-making algorithms be held to higher standards of transparency than human beings? The way we answer this question directly impacts what we demand from explainable algorithms, how we govern them via regulatory proposals, and how explainable algorithms may help resolve the social problems associated with decision making supported by artificial intelligence. Some argue that algorithms and humans should be held to the same standards of transparency and that a double standard of transparency is hardly justified. We give two arguments (...) to the contrary and specify two kinds of situations for which higher standards of transparency are required from algorithmic decisions as compared to humans. Our arguments have direct implications on the demands from explainable algorithms in decision-making contexts such as automated transportation. (shrink)

Within the program of finding axiomatizations for various parts of computability logic, it was proven earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting’s intuitionistic calculus. That sort of reduction permits unlimited reusage of the computational resource represented by the antecedent. An at least equally basic and natural sort of algorithmic reduction, however, is the one that does not allow such reusage. The present article shows that turning the logic of the first sort of (...) reduction into the logic of the second sort of reduction takes nothing more than just deleting the contraction rule from its Gentzen-style axiomatization. The first sort of interactive reduction is also shown to come in three natural versions. While those three versions are very different from each other, their logical behaviors turn out to be indistinguishable, with that common behavior being precisely captured by implicative intuitionistic logic. Among the other contributions of the present article is an informal introduction of a series of new — finite and bounded — versions of recurrence operations and the associated reduction operations. (shrink)

People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.

In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a (...) set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature. (shrink)

This study focused on the identification problems of two-input single-output system with moving average noises based on unsupervised learning methods applied to the input signals. The input signal to the autoregressive moving average model is proposed to be arriving from a source with continuous technical and environmental changes as two separate featured input signals. These two input signals were grouped in a number of clusters using the K-means clustering algorithm. The clustered input signals were supplied to the model in (...) an orderly fashion from cluster-1 up to cluster-K. To ensure that the output signal can be best predicted from the input signal which in turn leads to selecting good enough model for its intended use, the magnitude-squared coherence measure is applied to the input/output signals in the cases of clustered and nonclustered inputs, which indicates best correlation coefficient when measured with clustered inputs. From collected input-output signals, we deduce a K-means clustering based recursive least squares method for estimating the parameter of autoregressive moving average system. The simulation results indicate that the suggested method is effective. (shrink)

The Fairness, Accountability, and Transparency (FAccT) literature tends to focus on bias as a problem that requires ex post solutions (e.g. fairness metrics), rather than addressing the underlying social and technical conditions that (re)produce it. In this article, we propose a complementary strategy that uses genealogy as a constructive, epistemic critique to explain algorithmic bias in terms of the conditions that enable it. We focus on XAI feature attributions (Shapley values) and counterfactual approaches as potential tools to gauge these conditions (...) and offer two main contributions. One is constructive: we develop a theoretical framework to classify these approaches according to their relevance for bias as evidence of social disparities. We draw on Pearl’s ladder of causation (Causality: models, reasoning, and inference. Cambridge University Press, Cambridge, 2000, Causality, 2nd edn. Cambridge University Press, Cambridge, 2009. doi:10.1017/CBO9780511803161) to order these XAI approaches concerning their ability to answer fairness-relevant questions and identify fairness-relevant solutions. The other contribution is critical: we evaluate these approaches in terms of their assumptions about the role of protected characteristics in discriminatory outcomes. We achieve this by building on Kohler-Hausmann’s (Northwest Univ Law Rev 113(5):1163–1227, 2019) constructivist theory of discrimination. We derive three recommendations for XAI practitioners to develop and AI policymakers to regulate tools that address algorithmic bias in its conditions and hence mitigate its future occurrence. (shrink)

This article explores some of the concerns which are being raised about algorithms with recourse to Habermas’s theory of communicative action. The intention is not to undertake an empirical examination of ‘algorithms’ or their consequences but to connect critical theory to some contemporary concerns regarding digital cultures. Habermas’s ‘colonization of life-worlds’ thesis gives theoretical expression to two different trends which underlie many current criticisms of the insidious influence of digital algorithms: the privatization of communication, and the particularization of knowledge and (...) experience. Habermas’s social theory therefore offers a useful framework for exploring some of the normative and political problems that are attributed to ‘algorithmic culture’ and ‘big data’. (shrink)

In this paper, we distinguish between different sorts of assessments of algorithmic systems, describe our process of assessing such systems for ethical risk, and share some key challenges and lessons for future algorithm assessments and audits. Given the distinctive nature and function of a third-party audit, and the uncertain and shifting regulatory landscape, we suggest that second-party assessments are currently the primary mechanisms for analyzing the social impacts of systems that incorporate artificial intelligence. We then discuss two kinds of (...) as-sessments: an ethical risk assessment and a narrower, technical algo-rithmic bias assessment. We explain how the two assessments depend on each other, highlight the importance of situating the algorithm within its particular socio-technical context, and discuss a number of lessons and challenges for algorithm assessments and, potentially, for algorithm audits. The discussion builds on our team’s experience of advising and conducting ethical risk assessments for clients across dif-ferent industries in the last four years. Our main goal is to reflect on the key factors that are potentially ethically relevant in the use of algo-rithms, and draw lessons for the nascent algorithm assessment and audit industry, in the hope of helping all parties minimize the risk of harm from their use. (shrink)

We consider two ways one might use algorithmic randomness to characterize a probabilistic law. The first is a generative chance* law. Such laws involve a nonstandard notion of chance. The second is a probabilistic* constraining law. Such laws impose relative frequency and randomness constraints that every physically possible world must satisfy. While each notion has virtues, we argue that the latter has advantages over the former. It supports a unified governing account of non-Humean laws and provides independently motivated solutions to (...) issues in the Humean best-system account. On both notions, we have a much tighter connection between probabilistic laws and their corresponding sets of possible worlds. Certain histories permitted by traditional probabilistic laws are ruled out as physically impossible. As a result, such laws avoid one variety of empirical underdetermination, but the approach reveals other varieties of underdetermination that are typically overlooked. (shrink)

How should we incorporate algorithms into humanistic scholarship? The typical approach is to clone what humans have done but faster, extrapolating expert insights to landfills of source material. But creative scholars do not clone tradition; instead, they produce readings that challenge closely held understandings. We theorize and then illustrate how to construct bad robots trained to surprise and provoke. These robots aren’t the most human but rather the most alien—not tame but dangerous. We explore the relationship between the reproduction of (...) tradition and the generation of surprise and then show how formalizing a particular humanistic theory as a Bayesian prior allows us to identify readings that disrupt it through a process of algorithmic abduction. Among the exploding universe of surprising (and mostly ridiculous) possible readings, algorithmic efficiency allows us to select readings that nonetheless garner substantial support from the total archive and so merit interpretation and engagement. It is in such interaction between alien and human readers that meaning is made and understanding disturbed; it is by extending alien readings to novel texts that the scholarly community tests the value of those readings. (shrink)

Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded extension. As such, strongly admissible sets and labellings can be used as an explanation of membership of the grounded extension, as is for instance done in some of the proof procedures for grounded semantics. In the current paper, we present two polynomial algorithms for constructing relatively small (...) strongly admissible labellings, with associated min–max numberings, for a particular argument. These labellings can be used as relatively small explanations for the argument’s membership of the grounded extension. Although our algorithms are not guaranteed to yield an absolute minimal strongly admissible labelling for the argument (as doing so would have implied an exponential complexity), our best performing algorithm yields results that are only marginally larger. Moreover, the runtime of this algorithm is an order of magnitude smaller than that of the existing approach for computing an absolute minimal strongly admissible labelling for a particular argument. As such, we believe that our algorithms can be of practical value in situations where the aim is to construct a minimal or near-minimal strongly admissible labelling in a time-efficient way. (shrink)

Big Data evangelists often argue that algorithms make decision-making more informed and objective—a promise hotly contested by critics of these technologies. Yet, to date, most of the debate has focused on the instruments themselves, rather than on how they are used. This article addresses this lack by examining the actual practices surrounding algorithmic technologies. Specifically, drawing on multi-sited ethnographic data, I compare how algorithms are used and interpreted in two institutional contexts with markedly different characteristics: web journalism and criminal justice. (...) I find that there are surprising similarities in how web journalists and legal professionals use algorithms in their work. In both cases, I document a gap between the intended and actual effects of algorithms—a process I analyze as “decoupling.” Second, I identify a gamut of buffering strategies used by both web journalists and legal professionals to minimize the impact of algorithms in their daily work. Those include foot-dragging, gaming, and open critique. Of course, these similarities do not exhaust the differences between the two cases, which are explored in the discussion section. I conclude with a call for further ethnographic work on algorithms in practice as an important empirical check against the dominant rhetoric of algorithmic power. (shrink)

We argue that machine learning algorithms can inflict microaggressions on members of marginalized groups and that recognizing these harms as instances of microaggressions is key to effectively addressing the problem. The concept of microaggression is also illuminated by being studied in algorithmic contexts. We contribute to the microaggression literature by expanding the category of environmental microaggressions and highlighting the unique issues of moral responsibility that arise when we focus on this category. We theorize two kinds of algorithmic microaggression, stereotyping and (...) erasure microaggressions, and argue that corporations are responsible for the microaggressions their algorithms create. As a case study, we look at the problems faced by Google’s autocomplete prediction and at the insufficiency of their solutions. The case study of autocomplete demonstrates our core claim that microaggressions constitute a distinct form of algorithmic bias and that identifying them as such allows us to avoid seeming solutions that recreate the same kinds of harms. Google has a responsibility to make information freely available, without exposing users to degradation. To fulfill its duties to marginalized groups, Google must abandon the fiction of neutral prediction and instead embrace the liberatory power of suggestion. (shrink)

A best-seller in its French edition, the construction of this book is original and its success in the French market demonstrates its appeal. It is based on three principles: 1. An organization of the chapters by families of algorithms : exhaustive search, divide and conquer, etc. At the contrary, there is no chapter only devoted to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. 2. For each family of algorithms, an introduction (...) is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. 3. For its most part, the book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented ; often, some classical errors are pointed at. Roughly speaking, two thirds of the book are devoted to the detailed rational construction of the solutions. (shrink)

Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This requires the understanding of various algorithm design techniques, how and when to use them to formulate solutions, and the context appropriate for each of them. Algorithms: Design Techniques (...) and Analysis advocates the study of algorithm design by presenting the most useful techniques and illustrating them with numerous examples -- emphasizing on design techniques in problem solving rather than algorithms topics like searching and sorting. Algorithmic analysis in connection with example algorithms are explored in detail. Each technique or strategy is covered in its own chapter through numerous examples of problems and their algorithms. Readers will be equipped with problem solving tools needed in advanced courses or research in science and engineering. (shrink)

Every scientist chooses a preferred level of analysis and this choice shapes the research program, even determining what counts as evidence. This contribution revisits Marr's three levels of analysis and evaluates the prospect of making progress at each individual level. After reviewing limitations of theorizing within a level, two strategies for integration across levels are considered. One is top–down in that it attempts to build a bridge from the computational to algorithmic level. Limitations of this approach include insufficient theoretical constraint (...) at the computation level to provide a foundation for integration, and that people are suboptimal for reasons other than capacity limitations. Instead, an inside-out approach is forwarded in which all three levels of analysis are integrated via the algorithmic level. This approach maximally leverages mutual data constraints at all levels. For example, algorithmic models can be used to interpret brain imaging data, and brain imaging data can be used to select among competing models. Examples of this approach to integration are provided. This merging of levels raises questions about the relevance of Marr's tripartite view. (shrink)

In a talk in 2013, Karin Knorr Cetina referred to ‘the interaction order of algorithms’, a phrase that implicitly invokes Erving Goffman's ‘interaction order’. This paper explores the application of the latter notion to the interaction of automated-trading algorithms, viewing algorithms as material entities and conceiving of the interaction order of algorithms as the ensemble of their effects on each other. The paper identifies the main way in which trading algorithms interact and focuses on two particularly Goffmanesque aspects of algorithmic (...) interaction: queuing and ‘spoofing’, or deliberate deception. Following Goffman's injunction not to ignore the influence on interaction of matters external to it, the paper examines some prominent such matters. Empirically, the paper draws on documentary analysis and 338 interviews conducted by the author with high-frequency traders and others involved in automated trading. (shrink)

Based on a deliberative democracy, this book uses a hermeneutic-critical methodology to study bibliographical sources and practical issues in order to analyse the possibilities, limits and consequences of the digital transformation of democracy. Drawing on a two-way democracy, the aim of this book is intended as an aid for thinking through viable alternatives to the current state of democracy with regard to its ethical foundations and the moral knowledge implicit in or assumed by the way we perceive and understand democracy. (...) It is intended to stimulate reflection and discussion on the basis that, by addressing what we understand as democracy, we can inevitably influence the reality known as democracy. Democracy’s evident regression in today’s world makes this all too apparent: it has become a hostage to all kinds of autocracies and technopopulisms, which are supported to a greater or lesser extent by the current algorithmic revolution. (shrink)

The paper offers a solution to the generality problem for a reliabilist epistemology, by developing an “algorithm and parameters” scheme for type-individuating cognitive processes. Algorithms are detailed procedures for mapping inputs to outputs. Parameters are psychological variables that systematically affect processing. The relevant process type for a given token is given by the complete algorithmic characterization of the token, along with the values of all the causally relevant parameters. The typing that results is far removed from the typings of (...) folk psychology, and from much of the epistemology literature. But it is principled and empirically grounded, and shows good prospects for yielding the desired epistemological verdicts. The paper articulates and elaborates the theory, drawing out some of its consequences. Toward the end, the fleshed-out theory is applied to two important case studies: hallucination and cognitive penetration of perception. (shrink)

In this paper we examine two approaches to the formal treatment of the notion of problem in the paradigm of algorithmic semantics. Namely, we will explore an approach based on Martin-Löf’s Constructive Type Theory, which can be seen as a direct continuation of Kolmogorov’s original calculus of problems, and an approach utilizing Tichý’s Transparent Intensional Logic, which can be viewed as a non-constructive attempt of interpreting Kolmogorov’s logic of problems. In the last section we propose Kolmogorov and CTT-inspired modifications to (...) TIL-based approach. The focus will be on non-empirical problems only. (shrink)

The way from linearly written derivations in natural deduction, introduced by Jaskowski and often used in textbooks, is a straightforward root-first translation. The other direction, instead, is tricky, because of the partially ordered assumption formulas in a tree that can get closed by the end of a derivation. An algorithm is defined that operates alternatively from the leaves and root of a derivation and solves the problem.

In this position paper, we introduce a new epistemic lens for analyzing algorithmic harm. We argue that the epistemic lens we propose herein has two key contributions to help reframe and address some of the assumptions underlying inquiries into algorithmic fairness. First, we argue that using the framework of epistemic injustice helps to identify the root causes of harms currently framed as instances of representational harm. We suggest that the epistemic lens offers a theoretical foundation for expanding approaches to algorithmic (...) fairness in order to address a wider range of harms not recognized by existing technical or legal definitions. Second, we argue that the epistemic lens helps to identify the epistemic goals of inquiries into algorithmic fairness. There are two distinct contexts within which we examine algorithmic harm: at times, we seek to understand and describe the world as it is, and, at other times, we seek to build a more just future. The epistemic lens can serve to direct our attention to the epistemic frameworks that shape our interpretations of the world as it is and the ways we envision possible futures. Clarity with respect to which epistemic context is relevant in a given inquiry can further help inform choices among the different ways of measuring and addressing algorithmic harms. We introduce this framework with the goal of initiating new research directions bridging philosophical, legal, and technical approaches to understanding and mitigating algorithmic harms. (shrink)

In this APA blog, I appeal to two 2020 cases of algorithms gone wrong to motivate philosophical attention to algorithmic oppression. I offer a simple definition, then describe a few of the ways it is engendered. References and extends work by Safiya Noble, Cathy O'Neil, Ruha Benjamin, Virginia Eubanks, Sara Wachter-Boettcher, Michael Kearns & Aaron Roth.

Philosophers have established that certain ethically important val- ues are modally robust in the sense that they systematically deliver correlative benefits across a range of counterfactual scenarios. In this paper, we contend that recourse – the systematic process of reversing unfavorable decisions by algorithms and bureaucracies across a range of counterfactual scenarios – is such a modally ro- bust good. In particular, we argue that two essential components of a good life – temporally extended agency and trust – are under- (...) written by recourse. We critique existing approaches to the conceptualization, op- erationalization and implementation of recourse. Based on these criticisms, we suggest a revised approach to recourse and give ex- amples of how it might be implemented – especially for those who are least well off. (shrink)

In this paper I argue that some examples of what we label ‘algorithmic bias’ would be better understood as cases of institutional bias. Even when individual algorithms appear unobjectionable, they may produce biased outcomes given the way that they are embedded in the background structure of our social world. Therefore, the problematic outcomes associated with the use of algorithmic systems cannot be understood or accounted for without a kind of structural account. Understanding algorithmic bias as institutional bias in particular (as (...) opposed to other structural accounts) has at least two important upshots. First, I argue that the existence of bias that is intrinsic to certain institutions (whether algorithmic or not) suggests that at least in some cases, the algorithms now substituting as pieces of institutional norms or rules are not “fixable” in the relevant sense, because the institutions they help make up are not fixable. Second, I argue that in other cases, changing the algorithms being used within our institutions (rather than getting rid of them entirely) is essential to changing the background structural conditions of our society. (shrink)

Effective content moderation by social platforms is both important and difficult; numerous issues arise from the volume of information, the culturally sensitive and contextual nature of that information, and the nuances of human communication. Attempting to scale moderation, social platforms are increasingly adopting automated approaches to suppressing communications that they deem undesirable. However, this brings its own concerns. This paper examines the structural effects of algorithmic censorship by social platforms to assist in developing a fuller understanding of the risks of (...) such approaches to content moderation. This analysis shows that algorithmic censorship is distinctive for two reasons: in potentially bringing all communications carried out on social platforms within reach and in potentially allowing those platforms to take a more active, interventionist approach to moderating those communications. Consequently, algorithmic censorship could allow social platforms to exercise an unprecedented degree of control over both public and private communications. Moreover, commercial priorities would be inserted further into the everyday communications of billions of people. Due to the dominance of the web by a few social platforms, this may be difficult or impractical to escape for many people, although opportunities for resistance do exist. (shrink)

As a discipline distinct from ecology, conservation biology emerged in the 1980s as a rigorous science focused on protecting biodiversity. Two algorithmic breakthroughs in information processing made this possible: place-prioritization algorithms and geographical information systems. They provided defensible, data-driven methods for designing reserves to conserve biodiversity that obviated the need for largely intuitive and highly problematic appeals to ecological theory at the time. But the scientific basis of these achievements and whether they constitute genuine scientific progress has been criticized. We (...) counter by pointing out important inaccuracies about the science and rejecting the apparent theory-first focus. More broadly, the case study reveals significant limitations of the predominant epistemic-semantic conceptions of scientific progress and the considerable merits of pragmatic, practically-oriented accounts. (shrink)

This dissertation addresses a variety of foundational issues pertaining to the notion of algorithm employed in mathematics and computer science. In these settings, an algorithm is taken to be an effective mathematical procedure for solving a previously stated mathematical problem. Procedures of this sort comprise the notional subject matter of the subfield of computer science known as algorithmic analysis. In this context, algorithms are referred to via proper names of which computational properties are directly predicated )). Moreover, many (...) formal results are traditionally stated by explicitly quantifying over algorithms. These observations motivate the view that algorithms are themselves abstract mathematical objects -- a view I refer to as algorithmic realism. The status of this view is clearly related to that of Church's Thesis -- i.e. the claim that a function is computable by an algorithm just in case it is partial recursive. But whereas Church's Thesis is widely accepted on the basis of several well-known mathematical analyses of algorithmic computability, there is presently no consensus on how we can uniformly identify individual algorithms with mathematical objects. In the first chapter of this work, I attempt to illustrate the theoretical significance of algorithmic realism. I suggest that this view is not only of foundational significance to computer science, but also worth highlighting due to the role algorithms play in the fixation of mathematical knowledge and their relationship to intensional entities such as propositions and properties. Chapter Two presents a formal framework for reducing computational discourse to mathematical discourse modeled on contemporary discussion of mathematical nominalism. Chapter Three is centered on a case study intended to illustrate the technical exigencies involved with defending algorithmic realism. Chapter Four explores various ways in which algorithms might be identified with models of computation. And finally, Chapter Five argues that no such identification can uniformly satisfy all statements of algorithmic identity and non-identity affirmed by computational practice. I suggest that the technical crux of algorithmic realism lies in the necessity of reducing recursive specifications of algorithms to iterative models of computation in a manner which preserves algorithmic identity. (shrink)

Although overarching if not foundational conceptualizations of digital governance in the field of critical data studies aptly account for and explain subjection, calculated resistance is left conceptually unattended despite case studies that document instances of resistance. I ask at the outset why conceptualizations of digital governance are so bleak, and I argue that all are underscored implicitly by a Deleuzian theory of desire that overlooks agency, defined here in Foucauldian terms. I subsequently conceptualize digital governance as encompassing subjection as well (...) as resistance, and I cast the two in relational perspective by making use of the concepts “affordance” and “assemblage” in conjunction with multiple subjectivities and Foucault's view of power as productive as well as his view of resistance as an “antagonism of strategies” in his late scholarship on resistance, ethics, and subjectivity. I offer examples of salient modes of what I call “productive” resistance, and from a Foucauldian perspective I explain how each mode targets and subverts technologies of repressive power to produce new elements of the digital environment and construct new truths. I conclude by recognizing the agency embodied in resistance as an end in itself, but I also consider that modes of productive resistance can have extrinsic value as they affect the fluid interaction among elements of the digital environment, potentially disrupting the presumed structure of dominance and dependence, and opening our conceptualization of algorithmic life to hopeful possibilities for change. (shrink)

Recent studies have shown that recidivism scoring algorithms like COMPAS have significant racial bias: Black defendants are roughly twice as likely as white defendants to be mistakenly classified as medium- or high-risk. This has led some to call for abolishing COMPAS. But many others have argued that algorithms should instead be given access to a defendant's race, which, perhaps counterintuitively, is likely to improve outcomes. This approach can involve either establishing race-sensitive risk thresholds, or distinct racial ‘tracks’. Is there a (...) moral difference between these two approaches? We first consider Deborah Hellman's view that the use of distinct racial tracks (but not distinct thresholds) does not constitute disparate treatment since the effects on individuals are indirect and does not rely on a racial generalization. We argue that this is mistaken: the use of different racial tracks seems both to have direct effects on and to rely on a racial generalization. We then offer an alternative understanding of the distinction between these two approaches—namely, that the use of different cut points is to the counterfactual comparative disadvantage, ex ante, of all white defendants, while the use of different racial tracks can in principle be to the advantage of all groups, though some defendants in both groups will fare worse. Does this mean that the use of cut points is impermissible? Ultimately, we argue, while there are reasons to be skeptical of the use of distinct cut points, it is an open question whether these reasons suffice to make a difference to their moral permissibility. (shrink)

As a discipline distinct from ecology, conservation biology emerged in the 1980s as a rigorous science focused on protecting biodiversity. Two algorithmic breakthroughs in information processing made this possible: place-prioritization algorithms and geographical information systems. They provided defensible, data-driven methods for designing reserves to conserve biodiversity that obviated the need for largely intuitive and highly problematic appeals to ecological theory at the time. But the scientific basis of these achievements and whether they constitute genuine scientific progress has been criticized. We (...) counter by pointing out important inaccuracies about the science and rejecting the apparent theory-first focus. More broadly, the case study reveals significant limitations of the predominant epistemic-semantic conceptions of scientific progress and the considerable merits of pragmatic, practically-oriented accounts. (shrink)

The world we inhabit is surrounded by ‘coded objects’ from credit cards to airplanes to telephones. Sadly the governance mechanisms of many of these technologies are only poorly understood, leading to the common premise that such technologies are ‘neutral’, thereby obscuring normative and power-related consequences of their design. In order to unpack supposedly neutral technologies, the following paper will try and foreground two of key questions around the technologies used on the global Internet: 1) how are content regulatory regimes governed (...) and 2) how are the algorithms embedded in software governed? The following paper will explore these two aspects in turn, before drawing conclusions on understanding the normative frameworks embedded in technological systems.Article first published online: 22 MARCH 2016. (shrink)