Institutions are increasingly employing algorithms to provide performance feedback to individuals by tracking productivity, conducting performance appraisals, and developing improvement plans, compared to traditional human managers. However, this shift has provoked considerable debate over the effectiveness and fairness of algorithmic feedback. This study investigates the effects of negative performance feedback (NPF) on the attitudes, cognition and behavior of medical researchers, comparing NPF from algorithms versus humans. Two scenario-based experimental studies were conducted with a total sample of 660 medical (...) researchers (algorithm group: N1 = 411; human group: N2 = 249). Study 1 analyzes the differences in scientific misconduct, moral disengagement, and algorithmic attitudes between the two sources of NPF. The findings reveal that NPF from algorithms shows higher levels of moral disengagement, scientific misconduct, and negative attitudes towards algorithms compared to NPF from humans. Study 2, grounded in trait activation theory, investigates how NPF from algorithms triggers individual’s egoism and algorithm aversion, potentially leading to moral disengagement and scientific misconduct. Results indicate that algorithm aversion triggers individuals’ egoism, and their interaction enhances moral disengagement, which in turn leads to increased scientific misconduct among researchers. This relationship is also moderated by algorithmic transparency. The study concludes that while algorithms can streamline performance evaluations, they pose significant risks to scientific misconduct of researchers if not properly designed. These findings extend our understanding of NPF by highlighting the emotional and cognitive challenges algorithms face in decision-making processes, while also underscoring the importance of balancing technological efficiency with moral considerations to promote a healthy research environment. Moreover, managerial implications include integrating human oversight in algorithmic NPF processes and enhancing transparency and fairness to mitigate negative impacts on medical researchers’ attitudes and behaviors. (shrink)

As more objections have been raised against grant peer-review for being costly and time-consuming, the legitimate question arises whether machine learning algorithms could help assess the epistemic efficiency of the proposed projects. As a case study, we investigated whether project efficiency in high energy physics can be algorithmically predicted based on the data from the proposal. To analyze the potential of algorithmic prediction in HEP, we conducted a study on data about the structure and outcomes of HEP experiments with (...) the goal of predicting their efficiency. In the first step, we assessed the project efficiency using Data Envelopment Analysis of 67 experiments conducted in the HEP laboratory Fermilab. In the second step, we employed predictive algorithms to detect which team structures maximize the epistemic performance of an expert group. For this purpose, we used the efficiency scores obtained by DEA and applied predictive algorithms – lasso and ridge linear regression, neural network, and gradient boosted trees – on them. The results of the predictive analyses show moderately high accuracy, indicating that they can be beneficial as one of the steps in grant review. Still, their applicability in practice should be approached with caution. Some of the limitations of the algorithmic approach are the unreliability of citation patterns, unobservable variables that influence scientific success, and the potential predictability of the model. (shrink)

In a time of big data, thinking about how we are seen and how that affects our lives means changing our idea about who does the seeing. Data produced by machines is most often ‘seen’ by other machines; the eye is in question is algorithmic. Algorithmic seeing does not produce a computational panopticon but a mechanism of prediction. The authority of its predictions rests on a slippage of the scientific method in to the world of data. Data science inherits (...) some of the problems of science, especially the disembodied ‘view from above’, and adds new ones of its own. As its core methods like machine learning are based on seeing correlations not understanding causation, it reproduces the prejudices of its input. Rising in to the apparatuses of governance, it reinforces the problematic sides of ‘seeing like a state’ and links to the recursive production of paranoia. It forces us to ask the question ‘what counts as rational seeing?’. Answering this from a position of feminist empiricism reveals different possibilities latent in seeing with machines. Grounded in the idea of conviviality, machine learning may reveal forgotten non-market patterns and enable free and critical learning. It is proposed that a programme to challenge the production of irrational pre-emption is also a search for the possibility of algorithmic conviviality. (shrink)

According to a traditional view, scientific laws and theories constitute algorithmic compressions of empirical data sets collected from observations and measurements. This article defends the thesis that, to the contrary, empirical data sets are algorithmically incompressible. The reason is that individual data points are determined partly by perturbations, or causal factors that cannot be reduced to any pattern. If empirical data sets are incompressible, then they exhibit maximal algorithmic complexity, maximal entropy and zero redundancy. They are therefore maximally efficient (...) carriers of information about the world. Since, on algorithmic information theory, a string is algorithmically random just if it is incompressible, the thesis entails that empirical data sets consist of algorithmically random strings of digits. Rather than constituting compressions of empirical data, scientific laws and theories pick out patterns that data sets exhibit with a certain noise. (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)

When philosophers discuss the possibility of machines making scientific discoveries, they typically focus on discoveries in physics, biology, chemistry and mathematics. Observing the rapid increase of computer-use in science, however, it becomes natural to ask whether there are any scientific domains out of reach for machine discovery. For example, could machines also make discoveries in qualitative social science? Is there something about humans that makes us uniquely suited to studying humans? Is there something about machines that would bar (...) them from such activity? A close look at the methodology of interpretive social science reveals several abilities necessary to make a social scientific discovery, and one capacity necessary to possess any of them is imagination. For machines to make discoveries in social science, therefore, they must possess imagination algorithms. (shrink)

Historians of molecular biology have paid significant attention to the role of scientific instruments and their relationship to the production of biological knowledge. For instance, Lily Kay has examined the history of electrophoresis, Boelie Elzen has analyzed the development of the ultracentrifuge as an enabling technology for molecular biology, and Nicolas Rasmussen has examined how molecular biology was transformed by the introduction of the electron microscope (Kay 1998, 1993; Elzen 1986; Rasmussen 1997). 1 Collectively, these historians have demonstrated how (...) instruments and other elements of the material culture of the laboratory have played a decisive role in determining the kind and quantity of .. (shrink)

For most of human history, human knowledge was considered to be something that was stored and captured by words. This began to change when Galileo said that the book of nature is written in the language of mathematics. Today, Dan Dennett and many others argue that all genuine scientific knowledge is in the form of mathematical algorithms. However, recently discovered neurocomputational algorithms can be used to justify the claim that there is genuine knowledge which is non-algorithmic. The (...) fact that these algorithms use prototype deployment, rather than mathematics or logic, gives us good reason to believe that there is a kind of knowledge that we derive from stories that is different from our knowledge of algorithms. Even though we would need algorithms to build a system that can make sense out of stories, we do not need to use algorithms when we ourselves embody a system that learns from stories. The success of the Galilean perspective in the physical sciences has often resulted in an attempt to mathematize the humanities. I am arguing that the dynamic neurocomputational perspective can give us a better understanding of how we get knowledge and wisdom from the stories told by disciplines such as Literature, History, Anthropology and Theology. This new neurological data can be used to justify the traditional pedagogy of these disciplines, which originally stressed the telling of stories rather than the learning of algorithms. (shrink)

Algorithmic decision-making increasingly shapes people's daily lives. Given that such autonomous systems can cause severe harm to individuals and social groups, fairness concerns have arisen. A human-centric approach demanded by scholars and policymakers requires considering people's fairness perceptions when designing and implementing algorithmic decision-making. We provide a comprehensive, systematic literature review synthesizing the existing empirical insights on perceptions of algorithmic fairness from 58 empirical studies spanning multiple domains and scientific disciplines. Through thorough coding, we systemize the current empirical literature (...) along four dimensions: (1) algorithmic predictors, (2) human predictors, (3) comparative effects (human decision-making vs. algorithmic decision-making), and (4) consequences of algorithmic decision-making. While we identify much heterogeneity around the theoretical concepts and empirical measurements of algorithmic fairness, the insights come almost exclusively from Western-democratic contexts. By advocating for more interdisciplinary research adopting a society-in-the-loop framework, we hope our work will contribute to fairer and more responsible algorithmic decision-making. (shrink)

In this paper, we will analyze the relationships among three important philosophical theses in Kuhn’s thought: the plurality of worlds thesis, the no universal algorithm thesis, and the niche-construction analogy. We will do that by resorting to a hitherto neglected notion employed by Kuhn: the idea of a feedback loop. We will show that this notion captures an important structural aspect of the epistemic dynamics at work in each of the three theses, therefore allowing us to read them as constituting (...) a virtuous epistemic cycle. Finally, we will apply our unified interpretation of the three theses to scientific practice to sketch a novel neo-Kuhnian picture of theory choice. (shrink)

John Searle dismisses the attempt to understand thought as a form of computation, on the grounds that it is not scientific. Science is concerned with intrinsic properties, i.e. those features which are not observer relative, e.g. science is concerned with mass but not with beauty. Computation, according to Searle, presupposes the property of following an algorithm, but algorithmicity is normative, by reason of appealing to function, and hence not intrinsic. I argue that Searle's critique presupposes the folk notion of (...) function, which is indeed normative. But this folk notion can be replaced by a purely descriptive analogue, thereby showing that algorithmicity can be construed as intrinsic after all. (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)

The ArgumentDagognet's work shows that making algorithmic compressions seems to be one of the major targets of scientific progress. This effort has been so successful that until recently one might have thought everything could be algorithmically compressed. Indeed, this statement, which might be seen as a scientific translation of the Hegelian thesis in its strong form, admits to some objective limits in computer science. Though a lot of algorithms are successful, there exist today, and perhaps forever, logical (...) and physical limits that cannot allow us to cherish the dream of a “theory of everything.” Moreover, a complete mastery of complexity does not seem possible — because some domains of reality are too complicated to be computable, because the human brain is too limited, because computers cannot do that much better than the human brain, and because, ultimately, there are some kinds of things it would make no sense to compress. This paper shows that Dagognet's work came to recognize what a glance at the history of algorithmics has made evident. (shrink)

In a 1955 lecture the physicist Richard Feynman reflected on the place of doubt within scientific practice. ‘Permit us to question, to doubt, to not be sure’, proposed Feynman, ‘it is possible to live and not to know’. In our contemporary world, the science of machine learning algorithms appears to transform the relations between science, knowledge and doubt, to make even the most doubtful event amenable to action. What might it mean to ‘leave room for doubt’ or ‘to (...) live and not to know’ in our contemporary culture, where the algorithm plays a major role in the calculability of doubts? I propose a posthuman mode of doubt that decentres the liberal humanist subject. In the science of machine learning algorithms the doubts of human and technological beings nonetheless dwell together, opening onto a future that is never fully reduced to the single output signal, to the optimised target. (shrink)

Recently, philosophers and social scientists have turned their attention to the epistemological shifts provoked in established sciences by their incorporation of big data techniques. There has been less focus on the forms of epistemology proper to the investigation of algorithms themselves, understood as scientific objects in their own right. This article, based upon 12 months of ethnographic fieldwork with Russian data scientists, addresses this lack through an investigation of the specific forms of epistemic attention paid to algorithms (...) by data scientists. On the one hand, algorithms are unlike other mathematical objects in that they are not subject to disputation through deductive proof. On the other hand, unlike concrete things in the world such as particles or organisms, algorithms cannot be installed as the objects of experimental systems directly. They can only be evaluated in their functioning as components of extended computational assemblages; on their own, they are inert. As a consequence, the epistemological coding proper to this evaluation does not turn on truth and falsehood but rather on the efficiency of a given algorithmic assemblage. This article suggests that understanding the forms of algorithmic rationality employed in such inquiry is crucial for charting the place of data science within the contemporary academy and knowledge economy more generally. (shrink)

Carnap described ways to test scientific hypotheses. However, Carnap acknowledged that confirmation can never be definite. This left open the issue about the criteria to accept hypotheses. On the other hand, Wang has developed a computer program working without sufficient knowledge or resources, which makes the action of the program akin to the manner the human mind thinks. Wang’s program includes quantitative indicators that can be assigned to the frequency and the confidence of sentences. The present paper tries to (...) link both approaches. The goal is to show how quantitative indicators such as those in Wang’s program can also be attributed to scientific hypotheses. Those indicators can help make decisions about the acceptance of the hypotheses. All of this allows proposing general characteristics for a possible algorithm to decide whether a particular hypothesis is admissible. (shrink)

In recent years, a plethora of high-profile scientific publications has been reporting about machine learning algorithms outperforming clinicians in medical diagnosis or treatment recommendations. This has spiked interest in deploying relevant algorithms with the aim of enhancing decision-making in healthcare. In this paper, we argue that instead of straightforwardly enhancing the decision-making capabilities of clinicians and healthcare institutions, deploying machines learning algorithms entails trade-offs at the epistemic and the normative level. Whereas involving machine learning might improve (...) the accuracy of medical diagnosis, it comes at the expense of opacity when trying to assess the reliability of given diagnosis. Drawing on literature in social epistemology and moral responsibility, we argue that the uncertainty in question potentially undermines the epistemic authority of clinicians. Furthermore, we elucidate potential pitfalls of involving machine learning in healthcare with respect to paternalism, moral responsibility and fairness. At last, we discuss how the deployment of machine learning algorithms might shift the evidentiary norms of medical diagnosis. In this regard, we hope to lay the grounds for further ethical reflection of the opportunities and pitfalls of machine learning for enhancing decision-making in healthcare. (shrink)

In the first part of our article we will refer the penetration of scientific terms into colloquial language, focusing on the sense in which the concept of an algorithm currently functions outside its original scope. The given examples will refer mostly to disciplines not directly related to computer science and to the colloquial language. In the next part we will also discuss the modifications made to the meaning of the term algorithm and how this concept is now understood in (...) computer science. Finally, we will discuss the problem of algorithmicity of evolutionary algorithms, i.e. we will try to answer the question whether – and to what extent – they are still algorithms in the classical sense. (shrink)

Despite their centrality to the scientific enterprise, both the nature of scientific variables and their relation to inductive inference remain obscure. I suggest that scientific variables should be viewed as equivalence classes of sets of physical states mapped to representations (often real numbers) in a structure preserving fashion, and argue that most scientific variables introduced to expand the degrees of freedom in terms of which we describe the world can be seen as products of an algorithmic (...) inductive inference first identified by William W. Rozeboom. This inference algorithm depends upon a notion of natural kind previously left unexplicated. By appealing to dynamical kinds—equivalence classes of causal system characterized by the interventions which commute with their time evolution—to fill this gap, we attain a complete algorithm. I demonstrate the efficacy of this algorithm in a series of experiments involving the percolation of water through granular soils that result in the induction of three novel variables. Finally, I argue that variables obtained through this sort of inductive inference are guaranteed to satisfy a variety of norms that in turn suit them for use in further scientific inferences. (shrink)

Automated algorithms are silently making crucial decisions about our lives, but most of the time we have little understanding of how they work. To counter this hidden influence, there have been increasing calls for algorithmic transparency. Much ink has been spilled over the informational account of algorithmic transparency—about how much information should be revealed about the inner workings of an algorithm. But few studies question the power structure beneath the informational disclosure of the algorithm. As a result, the information (...) disclosure itself can be a means of manipulation used by a group of people to advance their own interests. Instead of concentrating on information disclosure, this paper examines algorithmic transparency from the perspective of power, explaining how algorithmic transparency under a disciplinary power structure can be a technique of normalizing people’s behavior. The informational disclosure of an algorithm can not only set up some de facto norms, but also build a scientific narrative of its algorithm to justify those norms. In doing so, people would be internally motivated to follow those norms with less critical analysis. This article suggests that we should not simply open the black box of an algorithm without challenging the existing power relations. (shrink)

Algorithms have become a widespread trope for making sense of social life. Science, finance, journalism, warfare, and policing—there is hardly anything these days that has not been specified as “algorithmic.” Yet, although the trope has brought together a variety of audiences, it is not quite clear what kind of work it does. Often portrayed as powerful yet inscrutable entities, algorithms maintain an air of mystery that makes them both interesting and difficult to understand. This article takes on this (...) problem and examines the role of algorithms not as techno-scientific objects to be known, but as a figure that is used for making sense of observations. Following in the footsteps of Harold Garfinkel’s tutorial cases, I shall illustrate the implications of this view through an experiment with algorithmic navigation. Challenging participants to go on a walk, guided not by maps or GPS but by an algorithm developed on the spot, I highlight a number of dynamics typical of reasoning with running code, including the ongoing respecification of rules and observations, the stickiness of the procedure, and the selective invocation of the algorithm as an intelligible object. The materials thus provide an opportunity to rethink key issues at the intersection of the social sciences and the computational, including popular concerns with transparency, accountability, and ethics. (shrink)

Studying drug relationships can provide deeper information for the construction and maintenance of biomedical databases and provide more important references for disease treatment and drug development. The research model has expanded from the previous focus on a certain drug to the systematic analysis of the pharmaceutical network formed between drugs. Network model is suitable for the study of the nonlinear relationship of the pharmaceutical relationship by modeling the data learning. Association rule mining is used to find the potential correlations between (...) the various sets of massive data. Therefore, based on the network model, this research proposed an algorithm for drug interaction under improved association rules, which achieved accurate analysis and decision-making of drug relationship. Meanwhile, this research applied the established association rule algorithm to discuss the relationship between Chinese medicine and mental illness medicine and conducted the algorithm research and simulation analysis of the association relationship. The results showed the association rule algorithm based on the network model constructed was better than other association algorithms. It had reliability and superiority in decision-making in improving the drug-drug relationship. It also promoted the rational use of medicines and played a guiding role in pharmaceutical research. This provides scientific research personnel with research basis and research ideas for disease-related diagnosis. (shrink)

Machine learning algorithms may radically improve our ability to diagnose and treat disease. For moral, legal, and scientific reasons, it is essential that doctors and patients be able to understand and explain the predictions of these models. Scalable, customisable, and ethical solutions can be achieved by working together with relevant stakeholders, including patients, data scientists, and policy makers.

In the paper, a detailed analysis of some new logical aspects of Cantor’s diagonal proof of the uncountability of continuum is presented. For the first time, strict formal, axiomatic, and algorithmic definitions of the notions of potential and actual infinities are presented. It is shown that the actualization of infinite sets and sequences used in Cantor’s proof is a necessary, but hidden, condition of the proof. The explication of the necessary condition and its factual usage within the framework of Cantor’s (...) proof makes, Cantor’s proof invalid. It’s shown that traditional Cantor’s proof has a second necessary, but hidden as well, condition which is teleological by its nature, i.e., is not mathematical. The explication of the second necessary condition makes Cantor’s statement on the uncountability of continuum unprovable from the point of view of classical logic.One of the most dramatic facts in history of science is connected just with the notion of actual infinity and consists in the following. On the one hand, Aristotle, Berkeley, Locke, Descartes, Spinoza, Gauss, Kant, Cauchy, Kronecker, Hermite, Poincaré, Bair, Borel, Brouwer, Quine, Wittgenstein, Weyl, Luzin, and a lot of other outstanding creators of classical logic and classical mathematics, during millenniums, stated categorically and insistently warned about that the actual infinity is a self-contradictory notion and its usage in mathematics is inadmissible (e.g., according to Poincare, “There is no actual infinity. - Cantorians forgot that and fell into contradictions. Later generations will regard Mengenlehre (set theory) as a disease from which one has recovered”). On the other hand, a lot of outstanding scientists of the XX c.c., such as Hilbert, Church, Turing, Gödel, etc., and modern axiomatic set theory as a whole ignored this (intuitive though) opinion of genii and accepted Cantor’s “transfinite paradise”, based on the actual infinity. In the paper some logical, philosophical, and psychological aspects of this historical “favorable opposition” are analyzed, and the fact that the scientific intuition of genii has won the historical battle against the mytho-’logic’ of Cantor’s transfinite ‘paradise’ is explained and logically justified. (shrink)

ACMES is a multidisciplinary conference series that focuses on epistemological and mathematical issues relating to computation in modern science. This volume includes a selection of papers presented at the 2015 and 2016 conferences held at Western University that provide an interdisciplinary outlook on modern applied mathematics that draws from theory and practice, and situates it in proper context. These papers come from leading mathematicians, computational scientists, and philosophers of science, and cover a broad collection of mathematical and philosophical topics, including (...) numerical analysis and its underlying philosophy, computer algebra, reliability and uncertainty quantification, computation and complexity theory, combinatorics, error analysis, perturbation theory, experimental mathematics, scientific epistemology, and foundations of mathematics. By bringing together contributions from researchers who approach the mathematical sciences from different perspectives, the volume will further readers' understanding of the multifaceted role of mathematics in modern science, informed by the state of the art in mathematics, scientific computing, and current modeling techniques. (shrink)

The issue of whether formal reasoning or a computing-intensive approach is the most efficient manner to address scientific questions is the subject of some considerable debate and pertains not only to the nature of the phenomena and processes investigated by scientists, but also the nature of the equation and algorithm objects they use. Although algorithms and equations both rely on a common background of mathematical language and logic, they nevertheless possess some critical differences. They do not refer to (...) the same level of symbolization, as equations are based on integrated concepts in a denotational manner, while algorithms specifically break down a complex problem into more elementary operations, in an operational manner. They may therefore be considered as suited to the representation of different phenomena. Specifically, algorithms are by nature sufficient to represent weak emergent phenomena, but not strong emergent patterns, while equations can do both. Finally, the choice between equations and algorithms are by nature sufficient to represent weak emergent phenomena, but not strong emergent patterns, while equations behave conversely. We propose a simplified classification of scientific issues for which both equation- and/or algorithm-based approaches can be envisaged, and discuss their respective pros and cons. We further discuss the complementary and sometimes conflicting uses of equations and algorithms in a context of ecological theory of metapopulation dynamics. We finally propose both conceptual and practical guidelines for choosing between the alternative approaches. (shrink)

The field of scientific image integrity presents a challenging research bottleneck given the lack of available datasets to design and evaluate forensic techniques. The sensitivity of data also creates a legal hurdle that restricts the use of real-world cases to build any accessible forensic benchmark. In light of this, there is no comprehensive understanding on the limitations and capabilities of automatic image analysis tools for scientific images, which might create a false sense of data integrity. To mitigate this (...) issue, we present an extendable open-source algorithm library that reproduces the most common image forgery operations reported by the research integrity community: duplication, retouching, and cleaning. We create a large scientific forgery image benchmark with enriched ground truth using this library and realistic scientific images. All figures within the benchmark are synthetically doctored using images collected from creative commons sources. While collecting the source images, we ensured that the they did not present any suspicious integrity problems. Because of the high number of retracted papers due to image duplication, this work evaluates the state-of-the-art copy-move detection methods in the proposed dataset, using a new metric that asserts consistent match detection between the source and the copied region. All evaluated methods had a low performance in this dataset, indicating that scientific images might need a specialized copy-move detector. The dataset and source code are available at https://github.com/phillipecardenuto/rsiil. (shrink)

A considerable number of areas of bioscience, including gene and drug discovery, metabolic engineering for the biotechnological improvement of organisms, and the processes of natural and directed evolution, are best viewed in terms of a ‘landscape’ representing a large search space of possible solutions or experiments populated by a considerably smaller number of actual solutions that then emerge. This is what makes these problems ‘hard’, but as such these are to be seen as combinatorial optimisation problems that are best attacked (...) by heuristic methods known from that field. Such landscapes, which may also represent or include multiple objectives, are effectively modelled in silico, with modern active learning algorithms such as those based on Darwinian evolution providing guidance, using existing knowledge, as to what is the ‘best’ experiment to do next. An awareness, and the application, of these methods can thereby enhance the scientific discovery process considerably. This analysis fits comfortably with an emerging epistemology that sees scientific reasoning, the search for solutions, and scientific discovery as Bayesian processes. (shrink)

In the presently unfolding deepfake era, previously unrelated algorithmic superintelligence possibility claims cannot be scientifically analyzed in isolation anymore due to the connected inevitable epistemic interactions that have already commenced. For instance, deep-learning (DL) related algorithmic supremacy claims may intrinsically compete with both neuro-symbolic (NS) algorithmic and further quantum (Q) algorithmic superintelligence achievement claims. Concurrently, a variety of experimental combinations of DL, NS and Q directions are conceivable. While research on these three illustrative variants did not yet offer any clear (...) mutually applicable scientific definition of a purported supremacy level framed as goal, the currently most robust scientific evaluation frameworks would i.a. require a joint testing against pre-existing non-algorithmic supremacy baselines such as e.g. conscious supremacy and cellular supremacy. This autodidactic paper explains why, for scientific reasons, all algorithmic superintelligence achievement claims in the deepfake era can be condensed and subjected to a joint scientific evaluation framework comprising multiple successive civilization-level tasks of epistemic tunneling (ET). In light of this elusive requirement, recent claims of science automation are spurious and misleading. It is vital not to misapprehend algorithmic epistemic dark matter (EDM) mining and epistemic dark energy (EDE) generation as paradigm-shifting ET events. (shrink)

The purpose of the study is to propose a mechanism for assessing the competitiveness of an enterprise. The article deals with modern methods of assessing the competitiveness of an enterprise, the existing methods are classified into economic and managerial. The scientific novelty of the research lies in the fact that this paper attempts to form a mechanism for assessing the competitiveness of an enterprise based on the systematization of methods for assessing the competitiveness of an enterprise and the formulated (...) algorithm for their effective application. As a result, it is revealed that with the help of the proposed algorithm, a step-by-step methodological assessment of the competitiveness of the enterprise is carried out and its alternative competitiveness is evaluated. The algorithm allows you to identify the weaknesses of the operation of the enterprise, their causes and ways to eliminate them. (shrink)

In the article the basic procedures for finding of connective elements and resolving conflicts of references is analyzed. On the basis of this, a generalized algorithm is proposed that combines advantages of existing procedures for search for connective elements between phrases. The advantages of the selected procedures and their sequence are described, the formal description of input data and the results of the algorithm are presented. To optimize the procedure for scanning the text, the algorithm is performed as an iterative (...) reduction of the candidates for communication elements. This is achieved through the confirmation of non-conflict links and the gradual resolution of conflicts. (shrink)

In recent years, there has been increasing interest in investigating science communication. Some studies that address this issue attempt to develop a model to determine the level of confidence that an author or a scientific community has at a given time towards a theory or a group of theories. A well-established approach suggests that, in order to determine the level of certainty authors have with regard to the statements they make, one can identify specific lexical and morphosyntactical markers which (...) indicate their epistemic attitudes. This method is considered particularly appealing because it permits the development of an algorithmic model based on the quantitative analysis of the occurrence of these markers to assess automatically and objectively the opinion of an author or the predominant opinion of a scientific community on a topic at a given time. In this contribution we show that this line of research presents many kinds of problems especially when it is applied to research articles. To this aim, we propose two main lines of reasoning. The first one relies generally on the argumentative structure of scientific articles and shows that certainty/uncertainty markers are used differently in different argument forms and that therefore their number/frequency of use does not offer reliable indications for determining whether the topic at issue is considered by the authors to be more or less factual/speculative. The second one is based on the analysis of a sample of psychiatric research articles on homosexuality written over a long time span and taken from The British Journal of Psychiatry. Since the psychiatric perspective on homosexuality changed radically during the decades in which these articles were published, they offer an inventory of various kinds of argumentative strategies directed both at defending and confuting dominant as well as marginal positions. We focus especially on uncertainty markers and show that frequently the positions stated using expressions indicating uncertainty are actually not considered as conjectural or speculative by their authors, but that the use of uncertainty markers is motivated by a number of different and often incongruent rhetorical strategies. (shrink)

The article defines the algorithm and details the sequential tasks for building an effective model of automated classification of events in the information space. On the eve and during the armed aggression of the Russian Federation against Ukraine, the consequences of external negative information influence were noticeable. Therefore, the organization and implementation of counteraction to such influence is urgent. An important component of this activity is the classification of information events in the information space in order to further analyze them (...) and form proposals for decision-making to counteract the negative information impact. Given the fact that in the global information space and, in particular, the information space of the state in the interests of counteracting such influence, it is necessary to constantly process a significant amount of information, so the task of improving the efficiency of this process is provided by automating its components. The algorithm of the automated classification process is based on a number of consecutive tasks, namely: data retrieval, preelection of messages, saving pre-selected messages in the database, determining a set of indicators for automated classification of information events, pre-processing a single document, distribution of messages by criteria by categories, presentation of information in a convenient form, saving the results of classification in the database. The proposed material reveals the content of these tasks. The proposed algorithm will serve to automatically divide information events of different nature into categories in order to increase the efficiency of assessing the level of negative information impact on target audiences for timely response to its manifestations. (shrink)

Representation of scientific knowledge in ontologies suffers so often from the lack of computational knowledge required for inference. This article aims to perform quantitative analysis on physical systems, that is, to answer questions about values of quantitative state variables of a physical system with known structure. For this objective, we incorporate procedural knowledge on two distinct levels. At the domain-specific level, we propose a representation model for scientific knowledge, i.e. variables, theories, and laws of nature. At the domain-independent (...) level, we provide an algorithm which, given a system S with known structure and a relevant scientific theory T, extracts a constraint network, whose variables are state variables of S defined by T, and whose constraints raise from relevant laws in T. The constraint network is then solved, to build a system of equations whose unknowns are the output variables of S. The proposed representation model and reasoning algorithm are evaluated by applying them to classic analysis examples. (shrink)

In our paper we investigate a difficulty arising when one tries to reconsiliateessentialis t’s thinking with classification practice in the biological sciences. The article outlinessome varieties of essentialism with particular attention to the version defended by Brian Ellis. Weunderline the basic difference: Ellis thinks that essentialism is not a viable position in biology dueto its incompatibility with biological typology and other essentialists think that these two elementscan be reconciled. However, both parties have in common metaphysical starting point and theylack explicit (...) track of methodological procedures. Methodological inquiry involves less demandingassumptions than metaphysical, and therefore it is justified to analyse abovementioned discrepancy between Ellis and other essentialist in this context. We do it by bottom-up investigation whichfocuses on the practice of taxonomists in the particular field of biology. A case study helps us todiscover four characteristics of biological typology practice: impossibility of algorithmization,relativity, subjectivity and conventionality. These features prove non-realistic and therefore anti-essentialistic character of biological classification. We conclude by saying that any essentialismrelated to the notion of biological kind cannot be regarded as justified by scientific enterprise of creating typologies. (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)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise (...) algorithmic computation and to offer foundations for scientific computing. -/- The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. -/- In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. -/- In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

Using mathematical tools from number theory and finite fields, Applied Algebra: Codes, Ciphers, and Discrete Algorithms, Second Edition presents practical methods for solving problems in data security and data integrity. It is designed for an applied algebra course for students who have had prior classes in abstract or linear algebra. While the content has been reworked and improved, this edition continues to cover many algorithms that arise in cryptography and error-control codes. New to the Second Edition A CD-ROM (...) containing an interactive version of the book that is powered by Scientific Notebook®, a mathematical word processor and easy-to-use computer algebra system New appendix that reviews prerequisite topics in algebra and number theory Double the number of exercises Instead of a general study on finite groups, the book considers finite groups of permutations and develops just enough of the theory of finite fields to facilitate construction of the fields used for error-control codes and the Advanced Encryption Standard. It also deals with integers and polynomials. Explaining the mathematics as needed, this text thoroughly explores how mathematical techniques can be used to solve practical problems. About the Authors Darel W. Hardy is Professor Emeritus in the Department of Mathematics at Colorado State University. His research interests include applied algebra and semigroups. Fred Richman is a professor in the Department of Mathematical Sciences at Florida Atlantic University. His research interests include Abelian group theory and constructive mathematics. Carol L. Walker is Associate Dean Emeritus in the Department of Mathematical Sciences at New Mexico State University. Her research interests include Abelian group theory, applications of homological algebra and category theory, and the mathematics of fuzzy sets and fuzzy logic. (shrink)

Fake news can originate from an ordinary person carelessly posting what turns out to be false information or from the intentional actions of fake news factory workers, but broadly speaking it can also originate from scientific fraud. In the latter case, the article can be retracted upon discovery of the fraud. A case study shows, however, that such fake science can be visible in Google even after the article was retracted, in fact more visible than the retraction notice. We (...) hypothesize that the reason for this lies in the popularity-based logic governing Google, in particular its foundational PageRank algorithm, in conjunction with a psychological law which we refer to as the “law of retraction”: a retraction notice is typically taken to be less interesting and therefore less popular with internet users than the original content retracted. We conduct an empirical study drawing on records of articles retracted due to fraud in the Retraction Watch public database. The study tests the extent to which such retracted scientific articles are still highly ranked in Google –and more so than information about the retraction. We find, among other things, that both Google Search and Google Scholar more often than not ranked a link to the original article higher than a link indicating that the article has been retracted. Surprisingly, Google Scholar did not perform better in this regard than Google Search.We also found cases in which Google did not track the retraction of an article on the first result page at all. We conclude that both Google Search and Google Scholar run the risk of disseminating fake science through their ranking algorithms. (shrink)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise (...) algorithmic computation and to offer foundations for scientific computing. The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

This article examines the nature of scientific knowledge generated by Large Language Models (LLMs) and assesses their impact on scientific discoveries and the philosophy of science. LLMs, such as GPT‑4, are advanced deep learning algorithms capable of performing various natural language processing tasks, including text generation, translation, and data analysis. The study aims to explore how these technologies influence the scientific research process, questioning the classification and validity of AI‑assisted scientific discoveries. The methodology involves a (...) comprehensive review of existing literature on the application of LLMs in various scientific fields, coupled with an analysis of their ethical implications. Key findings highlight the benefits of LLMs, including accelerated research processes, enhanced accuracy, and the ability to integrate interdisciplinary knowledge. However, challenges such as issues of reliability, the ethical responsibility of AI‑generated content, and environmental concerns are also discussed. The paper concludes that while LLMs significantly contribute to scientific advancements, their use necessitates a reevaluation of traditional concepts in the philosophy of science and the establishment of new ethical guidelines to ensure transparency, accountability, and integrity in AI‑assisted research. This balanced approach aims to harness the potential of LLMs while addressing the ethical and practical challenges they present. (shrink)

Knowledge does not exist as an isolated “piece” of knowledge. Knowledge exists in an aggregated collective state. I define knowledge as a capacity for social action and as a model for reality, as the possibility to set “something in motion”, for example, to solve a task, to produce a material object such as a semiconductor chip or to be competent to prevent something from occurring, for example, the onset of an illness. In this sense, knowledge is a universal human phenomenon, (...) or an anthropological constant. This definition of the term “knowledge” is indebted to Francis Bacon’s famous observation that knowledge is power, a somewhat misleading translation of Bacon’s Latin phrase: scientia potential est. A basic assumption should be that knowledge is not a priori practical. The transformation of knowledge as an ability to act into practical knowledge requires congenial circumstances, such as power or authority that dictates the concrete conditions for action. In this con text, it is helpful to ask about the increasingly prominent role of algorithms (intellectual technology) in relation to knowledge such as ChatGPT software as well as contentious issue of the relation/difference between knowledge and information. (shrink)

Scientific methods are heuristic in nature. Heuristics are simplifying, incomplete, underdetermined and fallible problem-solving rules that can nevertheless serve certain goals in certain contexts better than truth-preserving algorithms. Because of their goal- and context-dependence, a framework is needed for systematic choosing between them. This is the domain of scientific methodology. Such a methodology, I argue, relies on a form of instrumental rationality. Three challenges to such an instrumentalist account are addressed. First, some authors have argued that the (...) rational choice of at least some methods, namely those supporting belief formation, is not goal-dependent. Second, some authors have observed that some method choices seem intuitively rational, even though relevant goals are lacking. Thirdly, some authors have argued that instrumental rationality itself depends on a goal-independent form of rationality. It is the heuristic nature of scientific methods that affords me the arguments against these challenges. This heuristic-instrumentalist account provides the means-ends analysis needed to evaluate heuristic method choice. The paper thus offers the conceptual basis for a scientific methodology that is both compatible with the heuristic nature of actual scientific practice and also normatively relevant for assessing method choice. (shrink)

Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Experimentation is necessary. The analysis of algorithms should follow the same principles and standards of other empirical sciences. This article focuses on stochastic search algorithms, such as evolutionary algorithms or particle swarm optimization. Stochastic search algorithms tackle hard real-world optimization problems, e.g., problems from chemical engineering, airfoil optimization, or bioinformatics, where (...) classical methods from mathematical optimization fail. Nowadays statistical tools that are able to cope with problems like small sample sizes, non-normal distributions, noisy results, etc. are developed for the analysis of algorithms. Although there are adequate tools to discuss the statistical significance of experimental data, statistical significance is not scientifically meaningful per se. It is necessary to bridge the gap between the statistical significance of an experimental result and its scientific meaning. We will propose some ideas on how to accomplish this task based on Mayo's learning model. (shrink)

Scholars in both digital humanities and media studies have noted an apparent disconnect between computation and the interpretive methods of the humanities. Alan Liu has argued that literary scholars employing digital methods encounter a “meaning problem” due to the difficulty of reconciling algorithmic methods with interpretive ones. Conversely, the media scholar Friedrich Kittler has questioned the adequacy of hermeneutics as a means of studying computers. This paper argues that that this disconnect results from a set of contingent decisions made in (...) both humanistic and mathematical disciplines in the first half of the nineteenth century that delineated, with implications that continue to resonate in the present day, which aspects of human activity would come to be formalized in algorithms and which would not. I begin with a discussion of Nicolas de Condorcet, who attempted, at the height of the 1789 revolution, to turn algebra into a universal language; his work, I argue, exemplifies the form of algorithmic thinking that existed before the Romantic turn. Next, I discuss William Wordsworth’s arguments about the relationship of poetry and science. While Wordsworth is sometimes viewed as a critic of science, I argue that his polemic is specifically targeted at highly politicized projects like Condorcet’s that sought to supplant existing modes of thought with scientific rationality. Finally, I demonstrate the importance of Romantic thought for George Boole, creator of the logic system that would eventually form the basis of digital electronics. The reason Boole was able to succeed where Condorcet had failed, I argue, was that Romantic notions of culture enabled him to reconcile a mechanical view of mathematical reasoning with an organic view of the development of meaning—a dichotomy that remains a key assumption of computer interfaces in the twenty-first century. (shrink)

Abstract This chapter is interested in the epistemology of algorithms. As I intend to approach the topic, this is an issue about epistemic justification. Current approaches to justification emphasize the transparency of algorithms, which entails elucidating their internal mechanisms –such as functions and variables– and demonstrating how (or that) these produce outputs. Thus, the mode of justification through transparency is contingent on what can be shown about the algorithm and, in this sense, is internal to the algorithm. In (...) contrast, I advocate for an externalist epistemology of algorithms that I term computational reliabilism (CR). While I have previously introduced and examined CR in the field of computer simulations ([42, 53, 4]), this chapter extends this reliabilist epistemology to encompass a broader spectrum of algorithms utilized in various scientific disciplines, with a particular emphasis on machine learning applications. At its core, CR posits that an algorithm’s output is justified if it is produced by a reliable algorithm. A reliable algorithm is one that has been specified, coded, used, and maintained utilizing reliability indicators. These reliability indicators stem from formal methods, algorithmic metrics, expert competencies, cultures of research, and other scientific endeavors. The primary aim of this chapter is to delineate the foundations of CR, explicate its operational mechanisms, and outline its potential as an externalist epistemology of algorithms. (shrink)