In this paper, building on these previous works, we propose to go deeper into the understanding of crowd behavior by proposing an approach which integrates ontologi- cal models of crowd behavior and dedicated computer vision algorithms, with the aim of recognizing some targeted complex events happening in the playground from the observation of the spectator crowd behavior. In order to do that, we first propose an ontology encoding available knowledge on spectator crowd behavior, built as a spe- cialization of the (...) DOLCE foundational ontology, which allows the representation of categories belonging both to the physical and to the social realms. We then propose a simplified and tractable version of such ontology in a new temporal extension of a description logic, which is used for temporally coupling events happening on the play- ground and spectator crowd behavior. At last, computer vision algorithms provide the input information concerning what is observed on the stands and ontological reasoning delivers the output necessary to perform complex event recognition. (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)

Review of The Computational Theory of Mind by Matteo Colombo and Gualtiero Piccinini. Cambridge, 2023, iv + 75 pp, $64.99 HB.

The processes of computation and automation that produce digitized objects have displaced the concept of an image once conceived through optical devices such as a photographic plate or a camera mirror that were invented to accommodate the human eye. Computational images exist as information within networks mediated by machines. They are increasingly less about what art history understands as representation or photography considers indexing and more an operational product of data processing. Through genealogical, theoretical, and practice-based investigation, this dissertation project (...) traces a lineage of computation through images from early cybernetics to contemporary machine learning under algorithmic capitalist conditions of political economy. Objects include mundane examples such as smartphone cameras to sublime examples such as the imaging of black holes. It articulates new conditions and forms of perception and surveillance that result from contemporary technological development in computation. The project builds on theorists of computational media such as Friedrich Kittler, Wendy Hui Kyong Chun, Jussi Parikka, Shane Denson, and Alexander Galloway to examine the interplay between perception, computation, and epistemology. Further theoretical contribution builds on the work of Luciana Parisi and Jacques Ranciére’s articulation of aesthetics, and Michel Foucault’s gesture towards a heterotopia. Finally, it draws from Donna Haraway’s metaphors of the cyborg and sympoiesis to frame the capacity of art to transfigure the limitations of digital network culture into new possibilities for being. Here, it curates practices by Danielle Brathwaite-Shirley, Harun Farocki, Morehshin Allahyari, and Pierre Huyghe. (shrink)

Ever since the era of internet had ushered in cloud computing, there had been increase in the demand for the unlimited data available through cloud computing for data analysis, pattern recognition and technology advancement. With this also bring the problem of scalability, efficiency and security threat. This research paper focuses on how data can be dynamically mine in real time for pattern detection in a secure cloud computing environment using combination of decision tree algorithm and Random Forest over a restful (...) Application Programming Interface (API). We are able to successfully Implement data mining on cloud computing bypassing or avoiding direct interaction with data warehouse and without any terminal involve by using combination of IBM Cloud storage facility, Amazing Web Service, Application Programming Interface and Window service along with a decision tree and Random Forest algorithm for our classifier. We were able to successfully bypass direct connection with the data warehouse and cloud terminal with 94% accuracy in our model. (shrink)

cloud computing is a general term used to depict another class of system based computing that happens over the web. The essential advantage of moving to Clouds is application versatility. Cloud computing is extremely advantageous for the application which are sharing their resources on various hubs. Scheduling the errand is a significant testing in cloud condition. Typically undertakings are planned by client prerequisites. New scheduling techniques should be proposed to defeat the issues proposed by organize properties amongst client and resources. (...) New scheduling systems may utilize a portion of the customary scheduling ideas to consolidate them with some system mindful procedures to give answers for better and more effective employment scheduling. Scheduling technique is the key innovation in cloud computing. This paper gives the study on scheduling calculations. There working regarding the resource sharing. We systemize the scheduling issue in cloud computing, and present a cloud scheduling pecking order. (shrink)

Distributing the system workload and balancing all incoming requests among all processing nodes in cloud computing environments is one of the important challenges in today cloud computing world. Many load balancing algorithms and approaches have been proposed for distributed and cloud computing systems. In addition the broker policy for distributing the workload among different datacenters in a cloud environment is one of the important factors for improving the system performance. In this paper we present an analytical comparison for the combinations (...) of VM load balancing algorithms and different broker policies. We evaluate these approaches by simulating on CloudAnalyst simulator and the final results are presented based on different parameters. The results of this research specify the best possible combinations. (shrink)

Machine intelligence already helps medical staff with a number of tasks. Ethical decision-making, however, has not been handed over to computers. In this proof-of-concept study, we show how an algorithm based on Beauchamp and Childress’ prima-facie principles could be employed to advise on a range of moral dilemma situations that occur in medical institutions. We explain why we chose fuzzy cognitive maps to set up the advisory system and how we utilized machine learning to train it. We report on the (...) difficult task of operationalizing the principles of beneficence, non-maleficence and patient autonomy, and describe how we selected suitable input parameters that we extracted from a training dataset of clinical cases. The first performance results are promising, but an algorithmic approach to ethics also comes with several weaknesses and limitations. Should one really entrust the sensitive domain of clinical ethics to machine intelligence? (shrink)

As algorithms have become ubiquitous in consequential domains, societal concerns about the potential for discriminatory outcomes have prompted urgent calls to address algorithmic bias. In response, a rich literature across computer science, law, and ethics is rapidly proliferating to advance approaches to designing fair algorithms. Yet computer scientists, legal scholars, and ethicists are often not speaking the same language when using the term ‘bias.’ Debates concerning whether society can or should tackle the problem of algorithmic bias are hampered (...) by conflations of various understandings of bias, ranging from neutral deviations from a standard to morally problematic instances of injustice due to prejudice, discrimination, and disparate treatment. This terminological confusion impedes efforts to address clear cases of discrimination. -/- In this paper, we examine the promises and challenges of different approaches to disambiguating bias and designing for justice. While both approaches aid in understanding and addressing clear algorithmic harms, we argue that they also risk being leveraged in ways that ultimately deflect accountability from those building and deploying these systems. Applying this analysis to recent examples of generative AI, our argument highlights unseen dangers in current methods of evaluating algorithmic bias and points to ways to redirect approaches to addressing bias in generative AI at its early stages in ways that can more robustly meet the demands of justice. (shrink)

In information societies, operations, decisions and choices previously left to humans are increasingly delegated to algorithms, which may advise, if not decide, about how data should be interpreted and what actions should be taken as a result. More and more often, algorithms mediate social processes, business transactions, governmental decisions, and how we perceive, understand, and interact among ourselves and with the environment. Gaps between the design and operation of algorithms and our understanding of their ethical implications can have severe consequences (...) affecting individuals as well as groups and whole societies. This paper makes three contributions to clarify the ethical importance of algorithmic mediation. It provides a prescriptive map to organise the debate. It reviews the current discussion of ethical aspects of algorithms. And it assesses the available literature in order to identify areas requiring further work to develop the ethics of algorithms. (shrink)

This introduction to a special section on algorithmic thought provides a framework through which the articles in that collection can be contextualised and their individual contributions highlighted. Over the past decade, there has been a growing interest in artificial intelligence (AI). This special section reflects on this AI boom and its implications for studying what thinking is. Focusing on the algorithmic character of computing machines and the thinking that these machines might express, each of the special section’s essays (...) considers different dimensions of algorithmic thought, engaging with a diverse set of epistemological questions and issues. (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)

Cloud Computing is a developing field and lean toward by numerous one at current yet it's rage is part more rely upon its execution which thusly is excessively rely upon the powerful booking algorithm and load adjusting . In this paper we address this issue and propose an algorithm for private cloud which has high throughput and for open cloud which address the issue of condition awareness likewise with execution. To enhance the throughput in private cloud SJF is utilized for (...) planning and to conquer shape the issue of starvation we utilize limited pausing. For stack adjusting we screen the heap and dispatch the activity to the minimum stacked VM. To acquire advantage and to have open door for future upgrade out in the open cloud condition cognizance is the key factor and for better execution and load adjusting likewise wanted. While stack adjusting enhances the execution, the earth awareness increment the benefit of cloud suppliers. (shrink)

Does algorithmic political bias contribute to an entrenchment and polarization of political positions? Franke argues that it may do so because the bias involves classifications of people as liberals, conservatives, etc., and individuals often conform to the ways in which they are classified. I provide a novel example of this phenomenon in human–computer interactions and introduce a social psychological mechanism that has been overlooked in this context but should be experimentally explored. Furthermore, while Franke proposes that algorithmic political (...) classifications entrench political identities, I contend that they may often produce the opposite result. They can lead people to change in ways that disconfirm the classifications. Consequently and counterintuitively, algorithmic political bias can in fact decrease political entrenchment and polarization. (shrink)

The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational content is (...) extrinsic to formal procedures as such, and the intended interpretation of syntax makes no difference to the execution of an algorithm. So the unique 'content' postulated by RTM is superfluous to the formal procedures of CTM. And once these procedures are implemented in a physical mechanism, it is exclusively the causal properties of the physical mechanism that are responsible for all aspects of the system's behaviour. So once again, postulated content is rendered superfluous. To the extent that semantic content may appear to play a role in behaviour, it must be syntactically encoded within the system, and just as in a standard computational artefact, so too with the human mind/brain - it's pure syntax all the way down to the level of physical implementation. Hence 'content' is at most a convenient meta-level gloss, projected from the outside by human theorists, which itself can play no role in cognitive processing. (shrink)

Following Marr’s famous three-level distinction between explanations in cognitive science, it is often accepted that focus on modeling cognitive tasks should be on the computational level rather than the algorithmic level. When it comes to mathematical problem solving, this approach suggests that the complexity of the task of solving a problem can be characterized by the computational complexity of that problem. In this paper, I argue that human cognizers use heuristic and didactic tools and thus engage in cognitive processes (...) that make their problem solving algorithms computationally suboptimal, in contrast with the optimal algorithms studied in the computational approach. Therefore, in order to accurately model the human cognitive tasks involved in mathematical problem solving, we need to expand our methodology to also include aspects relevant to the algorithmic level. This allows us to study algorithms that are cognitively optimal for human problem solvers. Since problem solving methods are not universal, I propose that they should be studied in the framework of enculturation, which can explain the expected cultural variance in the humanly optimal algorithms. While mathematical problem solving is used as the case study, the considerations in this paper concern modeling of cognitive tasks in general. (shrink)

We cooperate with other people despite the risk of being exploited or hurt. If future artificial intelligence (AI) systems are benevolent and cooperative toward us, what will we do in return? Here we show that our cooperative dispositions are weaker when we interact with AI. In nine experiments, humans interacted with either another human or an AI agent in four classic social dilemma economic games and a newly designed game of Reciprocity that we introduce here. Contrary to the hypothesis that (...) people mistrust algorithms, participants trusted their AI partners to be as cooperative as humans. However, they did not return AI's benevolence as much and exploited the AI more than humans. These findings warn that future self-driving cars or co-working robots, whose success depends on humans' returning their cooperativeness, run the risk of being exploited. This vulnerability calls not just for smarter machines but also better human-centered policies. (shrink)

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...) \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

In this paper we analyze methodological and philosophical implications of algorithmic aspects of unconventional computation. At first, we describe how the classical algorithmic universe developed and analyze why it became closed in the conventional approach to computation. Then we explain how new models of algorithms turned the classical closed algorithmic universe into the open world of algorithmic constellations, allowing higher flexibility and expressive power, supporting constructivism and creativity in mathematical modeling. As Goedels undecidability theorems demonstrate, the (...) closed algorithmic universe restricts essential forms of mathematical cognition. In contrast, the open algorithmic universe, and even more the open world of algorithmic constellations, remove such restrictions and enable new, richer understanding of computation. (shrink)

In Darwin’s Dangerous Idea, Daniel Dennett claims that evolution is algorithmic. On Dennett’s analysis, evolutionary processes are trivially algorithmic because he assumes that all natural processes are algorithmic. I will argue that there are more robust ways to understand algorithmic processes that make the claim that evolution is algorithmic empirical and not conceptual. While laws of nature can be seen as compression algorithms of information about the world, it does not follow logically that they are (...) implemented as algorithms by physical processes. For that to be true, the processes have to be part of computational systems. The basic difference between mere simulation and real computing is having proper causal structure. I will show what kind of requirements this poses for natural evolutionary processes if they are to be computational. (shrink)

Implementing an algorithm on part of our causally-interconnected physical environment requires three choices that are typically considered arbitrary, i.e. no single option is innately privileged without invoking an external observer perspective. First, how to delineate one set of local causal relationships from the environment. Second, within this delineation, which inputs and outputs to designate for attention. Third, what meaning to assign to particular states of the designated inputs and outputs. Having explained these types of arbitrariness, we assess their relevance for (...) algorithms from various computational theories of mind (CTM) seeking to account for phenomenal consciousness. Some CTM accounts can survive some of these arbitrariness challenges, but eventually each one examined faces a trilemma. Each is under pressure to dilute at least one of three important CTM desiderata: its causal relevance, its substrate neutrality, or its assignment discrimination (e.g. ability to avoid near-panpsychism). However, unlike previous research, we suggest the debate cannot be fully settled at the level of principle. Certain complex CTM algorithms may be salvageable, albeit not the algorithms specified to date. The paper specifies three areas of investigative work, as well as further theoretical avenues of research, which computationalists may wish to explore to escape the trilemma. (shrink)

In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in P can feasibly work as computational (...) models of human cognitive capacities. One interesting area of computational complexity theory is descriptive complexity, which connects the expressive strength of systems of logic with the computational complexity classes. In descriptive complexity theory, it is established that only first-order (classical) systems are connected to P, or one of its subclasses. Consequently, second-order systems of logic are considered to be computationally intractable, and may therefore seem to be unfit to model human cognitive capacities. This would be problematic when we think of the role of logic as the foundations of mathematics. In order to express many important mathematical concepts and systematically prove theorems involving them, we need to have a system of logic stronger than classical first-order logic. But if such a system is considered to be intractable, it means that the logical foundation of mathematics can be prohibitively complex for human cognition. In this paper I will argue, however, that this problem is the result of an unjustified direct use of computational complexity classes in cognitive modelling. Placing my account in the recent literature on the topic, I argue that the problem can be solved by considering computational complexity for humanly relevant problem solving algorithms and input sizes. (shrink)

Cloud computing is the provision of IT resources (IaaS) on-demand using a pay as you go model over the internet. It is a broad and deep platform that helps customers builds sophisticated, scalable applications. To get the full benefits, research on a wide range of topics is needed. While resource over provisioning can cost users more than necessary, resource under provisioning hurts the application performance. The cost effectiveness of cloud computing highly depends on how well the customer can optimize the (...) cost of renting resources (VMs) from cloud providers. The issue of resource provisioning optimization from cloud-consumer potential is a complicated optimization issue, which includes much uncertainty parameters. There is a much research avenue available for solving this problem as it is in the real-world. Here, in this paper we provide details about various optimization techniques for resource provisioning. (shrink)

In philosophy of mind, zombies are imaginary creatures that are exact physical duplicates of conscious subjects but for whom there is no first-personal experience. Zombies are meant to show that physicalism—the theory that the universe is made up entirely out of physical components—is false. In this paper, I apply the zombie thought experiment to the realm of morality to assess whether moral agency is something independent from sentience. Algorithms, I argue, are a kind of functional moral zombie, such that thinking (...) about the latter can help us better understand and regulate the former. I contend that the main reason why algorithms can be neither autonomous nor accountable is that they lack sentience. Moral zombies and algorithms are incoherent as moral agents because they lack the necessary moral understanding to be morally responsible. To understand what it means to inflict pain on someone, it is necessary to have experiential knowledge of pain. At most, for an algorithm that feels nothing, ‘values’ will be items on a list, possibly prioritised in a certain way according to a number that represents weightiness. But entities that do not feel cannot value, and beings that do not value cannot act for moral reasons. (shrink)

This chapter uncovers the complex negotiations for authority in various representations about futures of life which have been advanced by different branches of the sciences, and have culminated in the emerging concept of life as algorithm. It charts the historical shifts in expertise and representations of life, from naturalists, to mathematical modellers, and specialists in computation, and argues that physicists, game theorists, and economists now take a leading role in explaining and projecting futures of life. The chapter identifies Richard Dawkins (...) and Max Tegmark at the forefront of the concept of life as algorithm: the first inspired by game theory as a means to study evolution; the second proposing that a materialist basis of life could place humans and artificial intelligence on an equal footing. Through close reading of their respective texts, the chapter demonstrates that both thinkers consider life as an algorithm programmed to achieve success in survival and reproduction. (shrink)

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

The counterfactual account of physical computation is simple and, for the most part, very attractive. However, it is usually thought to trivialize the notion of physical computation insofar as it implies ‘limited pancomputationalism’, this being the doctrine that every deterministic physical system computes some function. Should we bite the bullet and accept limited pancomputationalism, or reject the counterfactual account as untenable? Jack Copeland would have us do neither of the above. He attempts to thread a path between the two horns (...) of the dilemma by buttressing the counterfactual account with extra conditions intended to block certain classes of deterministic physical systems from qualifying as physical computers. His theory is called the ‘algorithm execution account’. Here we show that the algorithm execution account entails limited pancomputationalism, despite Copeland’s argument to the contrary. We suggest, partly on this basis, that the counterfactual account should be accepted as it stands, pancomputationalist warts and all. (shrink)

Concerns over epistemic opacity abound in contemporary debates on Artificial Intelligence (AI). However, it is not always clear to what extent these concerns refer to the same set of problems. We can observe, first, that the terms 'transparency' and 'opacity' are used either in reference to the computational elements of an AI model or to the models to which they pertain. Second, opacity and transparency might either be understood to refer to the properties of AI systems or to the epistemic (...) situation of human agents with respect to these systems. While these diagnoses are independently discussed in the literature, juxtaposing them and exploring possible interrelations will help to get a view of the relevant distinctions between conceptions of opacity and their empirical bearing. In pursuit of this aim, two pertinent conditions affecting computer models in general and contemporary AI in particular are outlined and discussed: opacity as a problem of computational tractability and opacity as a problem of the universality of the computational method. (shrink)

Algorithmic governmentality is a new form of political governance interconnected with technology and computation. By coining the term “algorithmic governmentality,” Antoinette Rouvroy argues that this mode of governance reduces everything to data, and people are no longer individuals but dividuals (able to be divided) or readable data profiles. Implementing the concept of algorithmic governmentality, the current study analyses Project Itoh’s award-winning novel Harmony in terms of such relevant concepts as “subjectivity,” “infra-individuality” and “control,” as suggested by Rouvroy (...) and colleagues. The analysis further draws on Foucault’s ideas of “governmentality” and “neoliberalism” and Deleuze’s concepts of “dividuality” and “society of control.” In Itoh’s fictional world, the entire society is subject to the new medical government, which replaced the chaotic world with a perfect but harrowing benevolent society, eradicating disease, suicide and crime. As elucidated in this paper, despite the dominant controlling government, there is a hope for humans to regain and reestablish their subjectivity and give meaning to their own personality by defying the nihilistic computational system. (shrink)

The literature on algorithmic fairness has examined exogenous sources of biases such as shortcomings in the data and structural injustices in society. It has also examined internal sources of bias as evidenced by a number of impossibility theorems showing that no algorithm can concurrently satisfy multiple criteria of fairness. This paper contributes to the literature stemming from the impossibility theorems by examining how informational richness affects the accuracy and fairness of predictive algorithms. With the aid of a computer simulation, (...) we show that informational richness is the engine that drives improvements in the performance of a predictive algorithm, in terms of both accuracy and fairness. The centrality of informational richness suggests that classification parity, a popular criterion of algorithmic fairness, should be given relatively little weight. But we caution that the centrality of informational richness should be taken with a grain of salt in light of practical limitations, in particular, the so-called bias-variance trade off. (shrink)

Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of which number is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of notation. The purpose of this article is to explore the relationship between (...) the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects. (shrink)

We study the algorithmic complexity of isomorphic embeddings between computable structures.

Accelerated computing leverages specialized hardware and software techniques to optimize the performance of computationally intensive tasks, offering significant speed-ups in scientific, engineering, and data-driven fields. This paper presents a comprehensive study examining the role of accelerated computing in enhancing processing capabilities and reducing execution times in diverse applications. Using a custom-designed experimental framework, we evaluated different methodologies for parallelization, GPU acceleration, and CPU-GPU coordination. The aim was to assess how various factors, such as data size, computational complexity, and task concurrency, (...) impact processing efficiency. Our findings reveal that implementing accelerated computing can achieve substantial improvements, often reducing computation times by more than 60% compared to traditional sequential methods. This paper details the experimental setup, including algorithm selection and parallelization techniques, and discusses the role of memory bandwidth and latency in achieving optimal performance. Based on the analysis, we propose a streamlined methodology to guide the deployment of accelerated computing frameworks in various industries. Concluding with a discussion on future directions, we highlight potential advancements in hardware architectures and software optimizations that could further augment computational efficiency and scalability in accelerated computing. (shrink)

In this paper, we deal with the computation of Lie derivatives, which are required, for example, in some numerical methods for the solution of differential equations. One common way for computing them is to use symbolic computation. Computer algebra software, however, might fail if the function is complicated, and cannot be even performed if an explicit formulation of the function is not available, but we have only an algorithm for its computation. An alternative way to address the problem is to (...) use automatic differentiation. In this case, we only need the implementation of the algorithm that evaluates the function in terms of its analytic expression in a programming language, but we cannot use this if we have only a compiled version of the function. In this paper, we present a novel approach for calculating the Lie derivative of a function, even in the case where its analytical expression is not available, that is based on the In finity Computer arithmetic. A comparison with symbolic and automatic differentiation shows the potentiality of the proposed technique. (shrink)

In this paper we shed new light on the Argument from Disagreement by putting it to test in a computer simulation. According to this argument widespread and persistent disagreement on ethical issues indicates that our moral opinions are not influenced by any moral facts, either because no such facts exist or because they are epistemically inaccessible or inefficacious for some other reason. Our simulation shows that if our moral opinions were influenced at least a little bit by moral facts, we (...) would quickly have reached consensus, even if our moral opinions were affected by factors such as false authorities, external political shifts, and random processes. Therefore, since no such consensus has been reached, the simulation gives us increased reason to take seriously the Argument from Disagreement. Our conclusion is however not conclusive; the simulation also indicates what assumptions one has to make in order to reject the Argument from Disagreement. The simulation algorithm we use builds on the work of Hegselmann and Krause (J Artif Soc Social Simul 5(3); 2002, J Artif Soc Social Simul 9(3), 2006). (shrink)

This is the 3rd edition. Although a number of new technological applications require classical deductive computation with non-classical logics, many key technologies still do well—or exclusively, for that matter—with classical logic. In this first volume, we elaborate on classical deductive computing with classical logic. The objective of the main text is to provide the reader with a thorough elaboration on both classical computing – a.k.a. formal languages and automata theory – and classical deduction with the classical first-order predicate calculus with (...) a view to computational implementations, namely in automated theorem proving and logic programming. The present third edition improves on the previous ones by providing an altogether more algorithmic approach: There is now a wholly new section on algorithms and there are in total fourteen clearly isolated algorithms designed in pseudo-code. Other improvements are, for instance, an emphasis on functions in Chapter 1 and more exercises with Turing machines. (shrink)

This paper presents the first bibliometric mapping analysis of the field of computer and information ethics (C&IE). It provides a map of the relations between 400 key terms in the field. This term map can be used to get an overview of concepts and topics in the field and to identify relations between information and communication technology concepts on the one hand and ethical concepts on the other hand. To produce the term map, a data set of over thousand articles (...) published in leading journals and conference proceedings in the C&IE field was constructed. With the help of various computer algorithms, key terms were identified in the titles and abstracts of the articles and co-occurrence frequencies of these key terms were calculated. Based on the co-occurrence frequencies, the term map was constructed. This was done using a computer program called VOSviewer. The term map provides a visual representation of the C&IE field and, more specifically, of the organization of the field around three main concepts, namely privacy, ethics, and the Internet. (shrink)

It is well known that the unpredictable speech production brought on by stress from the task at hand has a significant negative impact on the performance of speech processing algorithms. Speech therapy benefits from being able to detect stress in speech. Speech processing performance suffers noticeably when perceptually produced stress causes variations in speech production. Using the acoustic speech signal to objectively characterize speaker stress is one method for assessing production variances brought on by stress. Real-world complexity and ambiguity make (...) it difficult for decision-makers to express their conclusions with clarity in their speech. In particular, the Neutrosophic speech algorithm is used to encode the language variables because they cannot be computed directly. Neutrosophic sets are used to manage indeterminacy in a practical situation. Existing algorithms are used except for stress on Neutrosophic speech recognition. The creation of algorithms that calculate, categorize, or differentiate between different stress circumstances. Understanding stress and developing strategies to combat its effects on speech recognition and human-computer interaction system are the goals of this recognition. (shrink)

This book is an edited collection of original research papers on the digital revolution of the public and governance. It covers cyber governance in Finland, and the securitization of cyber security in Finland. It investigates the cases of Brexit, the 2016 US presidential election of Donald Trump, the 2017 presidential election of Volodymyr Zelensky, and Brexit. It examines the environmental concerns of climate change and greenwashing, and the impact of digital communication giving rise to the #MeToo and Incel movements. It (...) considers how digitilization can serve to emancipate women through ride-sharing, and how it leads to the question of robot rights. It considers fake news and algorithmic governance with respect to case studies of the Chinese social credit system, the US FICO credit score, along with Facebook, Twitter, Cambridge Analytica and the European effort to regulate and protect data usage. (shrink)

The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...) this relation must be given in the form of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The connection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization. (shrink)

We overview logical and computational explanations of the notion of tractability as applied in cognitive science. We start by introducing the basics of mathematical theories of complexity: computability theory, computational complexity theory, and descriptive complexity theory. Computational philosophy of mind often identifies mental algorithms with computable functions. However, with the development of programming practice it has become apparent that for some computable problems finding effective algorithms is hardly possible. Some problems need too much computational resource, e.g., time or memory, (...) to be practically computable. Computational complexity theory is concerned with the amount of resources required for the execution of algorithms and, hence, the inherent difficulty of computational problems. An important goal of computational complexity theory is to categorize computational problems via complexity classes, and in particular, to identify efficiently solvable problems and draw a line between tractability and intractability. -/- We survey how complexity can be used to study computational plausibility of cognitive theories. We especially emphasize methodological and mathematical assumptions behind applying complexity theory in cognitive science. We pay special attention to the examples of applying logical and computational complexity toolbox in different domains of cognitive science. We focus mostly on theoretical and experimental research in psycholinguistics and social cognition. (shrink)

In this paper, I defend the metalinguistic solution to the problem of mathematical omniscience for the possible-worlds account of propositions by combining it with a computational model of knowledge and belief. The metalinguistic solution states that the objects of belief and ignorance in mathematics are relations between mathematical sentences and what they express. The most pressing problem for the metalinguistic strategy is that it still ascribes too much mathematical knowledge under the standard possible-worlds model of knowledge and belief on which (...) these are closed under entailment. I first argue that Stalnaker's fragmentation strategy is insufficient to solve this problem. I then develop an alternative, computational strategy: I propose a model of mathematical knowledge and belief adapted from the algorithmic model of Halpern et al. which, when combined with the metalinguistic strategy, entails that mathematical knowledge and belief require computational abilities to access metalinguistic information, and thus aren't closed under entailment. As I explain, the computational model generalizes beyond mathematics to a version of the functionalist theory of knowledge and belief that motivates the possible-worlds account in the first place. I conclude that the metalinguistic and computational strategies yield an attractive functionalist, possible-worlds account of mathematical content, knowledge, and inquiry. (shrink)

Our private perception of listening to an individualized playlist during a jog is very different from the interaction we might experience at a live concert. We do realize that music is not necessarily a performing art, such as dancing or theater, while our demands regarding musical performances are conflicting: We expect perfect sound quality and the thrill of the immediate. We want the artist to overwhelm us with her virtuosity and we want her to struggle, just like a human. We (...) want to engage with the musical expression and rely on visual and physical cues. Considering that the ears of today's listeners are used to technologically mediated music, in this paper I explore the unique qualities of musical live performances and examine if our conception allows for new mechatronic inventions, in particular robotic musicians, to participate in this art form. Some of Godlovitch's main thoughts expounded in his work on "musical performance" [11] serve as a reference and starting point for this investigation. His concept of `personalism', which deprives computer-/program-based musical performances from expressive potential and creative accomplishment is an issue that I want to challenge by pointing out new approaches arising from a reective discourse on technology, embodiment and expression. The enquiry conducted illustrates, how in reasoning about machine performers and algorithmic realization of music, we also examine the perceptual, physical and social aspects of human musicianship, reconceptualizing our understanding of a musical live performance. (shrink)

Consumer behavior analytics has become a pivotal aspect for businesses to understand and predict customer preferences and actions. The advent of machine learning (ML) algorithms has revolutionized this field by providing sophisticated tools for data analysis, enabling businesses to make data-driven decisions. However, the effectiveness of these ML algorithms significantly hinges on the optimization techniques employed, which can enhance model accuracy and efficiency. This paper explores the application of various optimization techniques in consumer behaviour analytics using machine learning algorithms. By (...) focusing on the optimization of key parameters, the study aims to improve the predictive power of models and reduce computational costs. (shrink)

The hypergrowth and hyperconnectivity of networks of artificial intelligence (AI) systems and algorithms increasingly cause our interactions with the world, socially and environmentally, more technologically mediated. AI systems start interfering with our choices or making decisions on our behalf: what we see, what we buy, which contents or foods we consume, where we travel to, who we hire, etc. It is imperative to understand the dynamics of human-computer interaction in the age of progressively more competent AI. This essay presents five (...) premises to serve as starting points for building our understanding of the “interactions’ in human-computer interactions. (shrink)

Deliberate contextual vocabulary acquisition (CVA) is a reader’s ability to figure out a (not the) meaning for an unknown word from its “context”, without external sources of help such as dictionaries or people. The appropriate context for such CVA is the “belief-revised integration” of the reader’s prior knowledge with the reader’s “internalization” of the text. We discuss unwarranted assumptions behind some classic objections to CVA, and present and defend a computational theory of CVA that we have adapted to a new (...) classroom curriculum designed to help students use CVA to improve their reading comprehension. (shrink)

I develop a theory of counterfactuals about relative computability, i.e. counterfactuals such as 'If the validity problem were algorithmically decidable, then the halting problem would also be algorithmically decidable,' which is true, and 'If the validity problem were algorithmically decidable, then arithmetical truth would also be algorithmically decidable,' which is false. These counterfactuals are counterpossibles, i.e. they have metaphysically impossible antecedents. They thus pose a challenge to the orthodoxy about counterfactuals, which would treat them as uniformly true. What’s more, (...) I argue that these counterpossibles don’t just appear in the periphery of relative computability theory but instead they play an ineliminable role in the development of the theory. Finally, I present and discuss a model theory for these counterfactuals that is a straightforward extension of the familiar comparative similarity models. (shrink)

Abstract: Sarcasm is commonly used in news and detecting sarcasm in headline news is challenging for humans and thus for computers. The media regularly seem to engage sarcasm in their news headline to get the attention of people. However, people find it tough to detect the sarcasm in the headline news, hence receiving a mistaken idea about that specific news and additionally spreading it to their friends, colleagues, etc. Consequently, an intelligent system that is able to distinguish between can sarcasm (...) none sarcasm automatically is very important. The aim of the study is to build a sarcasm model that detect headline news using machine and deep learning and attempt to understand how a computer learns the patterns of sarcasm. The dataset used in this study was collected from Kaggle depository. We examined 21 algorithms of machine learning and one deep learning algorithm for detecting sarcasm in headline news. The evaluation metric used in this study are Accuracy, F1-measure, Recall, Precision, and Time needed for training and evaluation. The deep learning model achieved accuracy (95.27%), recall (96.62%), precision (94.15%), F1-score (95.37%) and time needed to train the mode (400 seconds), with loss of around 0.3398. However, the algorithm of machine learning that achieved the highest F1-Score is Passive Aggressive Classifier. It was the top classier for sarcasm detection among the machine learning algorithms with accuracy (95.50%), recall (96.09 %), precision (94.30%), F1-score (95.19%) and time needed to train the mode (0.31 seconds). (shrink)

The rapid advancement of intelligent computing has revolutionized the field of economic forecasting, providing unprecedented capabilities for developing, implementing, and analyzing advanced prediction models. This paper explores the comprehensive process of harnessing intelligent computing for economic forecasting, emphasizing the critical stages of model development, integration, and evaluation. Initially, it discusses data collection and preprocessing techniques essential for building robust models, followed by the selection of suitable statistical, machine learning, and deep learning algorithms. The paper then outlines the practical aspects of (...) model implementation, including real-time data integration, deployment strategies, and scalability considerations. Further, it delves into the continuous monitoring and maintenance required to ensure model accuracy and reliability over time. The analysis section evaluates model performance using various accuracy metrics, scenario analyses, and visualization techniques to provide actionable insights. Through case studies across the financial sector, government policy, and business planning, the paper illustrates the transformative impact of intelligent computing on economic forecasting. The findings underscore the potential of advanced prediction models to enhance decision-making, anticipate economic trends, and respond proactively to dynamic economic environments. (shrink)

The abstract basis of modern computation is the formal description of a finite state machine, the Universal Turing Machine, based on manipulation of integers and logic symbols. In this contribution to the discourse on the computer-brain analogy, we discuss the extent to which analog computing, as performed by the mammalian brain, is like and unlike the digital computing of Universal Turing Machines. We begin with ordinary reality being a permanent dialog between continuous and discontinuous worlds. So it is with computing, (...) which can be analog or digital, and is often mixed. The theory behind computers is essentially digital, but efficient simulations of phenomena can be performed by analog devices; indeed, any physical calculation requires implementation in the physical world and is therefore analog to some extent, despite being based on abstract logic and arithmetic. The mammalian brain, comprised of neuronal networks, functions as an analog device and has given rise to artificial neural networks that are implemented as digital algorithms but function as analog models would. Analog constructs compute with the implementation of a variety of feedback and feedforward loops. In contrast, digital algorithms allow the implementation of recursive processes that enable them to generate unparalleled emergent properties. We briefly illustrate how the cortical organization of neurons can integrate signals and make predictions analogically. While we conclude that brains are not digital computers, we speculate on the recent implementation of human writing in the brain as a possible digital path that slowly evolves the brain into a genuine (slow) Turing machine. (shrink)