According to the Best System Account of lawhood, laws of nature are theorems of the deductive systems that best balance simplicity and strength. In this paper, I advocate a different account of lawhood which is related, in spirit, to the BSA: according to my account, laws are theorems of deductive systems that best balance simplicity, strength, and also calculational tractability. I discuss two problems that the BSA faces, and I show that my account solves them. I also use (...) my account to illuminate the nomological character of special science laws. (shrink)

The aim of this article is to investigate the roles of commutative diagrams (CDs) in a specific mathematical domain, and to unveil the reasons underlying their effectiveness as a mathematical notation; this will be done through a case study. It will be shown that CDs do not depict spatial relations, but represent mathematical structures. CDs will be interpreted as a hybrid notation that goes beyond the traditional bipartition of mathematical representations into diagrammatic and linguistic. It will be argued that one (...) of the reasons why CDs form a good notation is that they are highly mathematically tractable: experts can obtain valid results by ‘calculating’ with CDs. These calculations, take the form of ‘diagram chases’. In order to draw inferences, experts move algebraic elements around the diagrams. It will be argued that these diagrams are dynamic. It is thanks to their dynamicity that CDs can externalize the relevant reasoning and allow experts to draw conclusions directly by manipulating them. Lastly, it will be shown that CDs play essential roles in the context of proof as well as in other phases of the mathematical enterprise, such as discovery and conjecture formation. (shrink)

Despite their success in describing and predicting cognitive behavior, the plausibility of so-called ‘rational explanations’ is often contested on the grounds of computational intractability. Several cognitive scientists have argued that such intractability is an orthogonal pseudoproblem, however, since rational explanations account for the ‘why’ of cognition but are agnostic about the ‘how’. Their central premise is that humans do not actually perform the rational calculations posited by their models, but only act as if they do. Whether or not the problem (...) of intractability is solved by recourse to ‘as if’ explanations critically depends, inter alia, on the semantics of the ‘as if’ connective. We examine the five most sensible explications in the literature, and conclude that none of them circumvents the problem. As a result, rational ‘as if’ explanations must obey the minimal computational constraint of tractability. (shrink)

FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a generalized (...) Principle of Bivalence. Each of these systems leads to defining an infinite hierarchy of tractable approximations to the respective logic, in terms of the maximum number of allowed nested applications of the two branching rules. Further, each resulting hierarchy admits of an intuitive 5-valued non-deterministic semantics. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...) linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

Perception solves computationally demanding problems at lightning fast speed. It recovers sophisticated representations of the world from degraded inputs, often in a matter of milliseconds. Any theory of perception must be able to explain how this is possible; in other words, it must be able to explain perception's computational tractability. One of the few attempts to move toward such an explanation has been the information encapsulation hypothesis, which posits that perception can be fast because it keeps computational costs low (...) by forgoing access to information stored in cognition. I argue that we have no compelling reason to believe that encapsulation explains (or even contributes to an explanation of) perceptual tractability, and much reason to doubt it. This is because there exist much deeper computational challenges for perception than information access, and these threaten to make the costs of access irrelevant. If this is right, it undermines a core computational motivation for encapsulation and sends us back to the drawing board for explanations of perceptual tractability. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

Zuse proposed that the universe is being computed by some sort of cellular automaton or other discrete computing machinery, challenging the long-held view that some physical laws are continuous by nature. Calculating Space is the title of MIT's English translation of Konrad Zuse's 1969 Rechnender Raum, the first work on digital physics. This is the LaTeX edition by A. German and H. Zenil based on the MIT's English translation with permission from the MIT and Konrad Zuse's son Horst Zuse. Followed (...) by an afterword by A. German and H. Zenil. (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 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)

The paper is a partly provocative essay edited as a humanitarian study in philosophy of science and social philosophy, reflecting on the practical, “anti-metaphysical” turn taken place since the 20th century and continuing until now. The article advocates that it is about time it to be overcome because it is the main obstacle for the further development of exact and natural sciences including mathematics therefore restoring the unity of philosophy and sciences in the dawn of modern science when the great (...) scientists were philosophers as a necessary condition for their revolutionary achievements, and the physicists were simultaneously mathematicians not less than philosophers and even theologians as Descartes, Newton, Leibnitz were just as their predecessors, Copernicus or Galileo Galilei. The revolution in science accomplished by them needed philosophy since any scientific revolution, then necessarily growing into social, needs philosophy; and if ones wish to prevent social revolutions originating from fundamental scientific discoveries, in turn relying on the close link of sciences and philosophy, they are to cut the link at issue, and just that happened in the 20th centuries therefore implicitly heralding a “brave new world” of eternal normal science without revolutions whether scientific or social. Fukuyama’s “end of history” requires an “end of scientific history” as it is an obligatory premise, and separating sciences from philosophy is sufficient for that, though proclaimed quite otherwise: as overcoming metaphysics preventing sciences and substituting them by quasi-sciences. Particularly, that “anti-metaphysical turn” has established for science to obey society absolutely and thoroughly, obviously a condition contradicting the scientific and social revolutions in Modernity featured by the domination of science over society by the mediation of philosophy able to translate all epochal scientific discoveries as social corollaries. A special attention is paid to quantum mechanics, being the frontier of physics in the 20th century, where that anti-metaphysical turn is discernibly concentrated and may be notated by the famous slogan “Shut up and calculate!” regardless of its authorship. Just the revolutionary discoveries in physics, for example those of “dark mass” and “dark energy” or entanglement force now its rejection therefore restoring the unity of philosophy, mathematics and physics, made ever possible the establishment of modern science by its emancipation from religion, and thus and ind final analysis, from society. (shrink)

This paper presents a novel understanding of the notion of calculability. In Gricean frameworks, calculability is defined in terms of how speakers can infer an implicature. The relevant inferences must e.g. be based on maxims of conversation or cooperation principles. Meanwhile, I suggest to define calculability in terms of when, or under which conditions, speakers can infer an implicature. An implicature is calculable if hearers can infer its existence even supposing that the implicature is not semantically encoded. This approach avoids (...) familiar challenges, including recently prominent challenges from pragmatic particularism. (shrink)

The value of health states is often understood to depend on their impact on the goodness of people's lives. As such, prominent health states metrics are grounded in particular conceptions of wellbeing – e.g. hedonism or preference satisfaction. In this paper, I consider how liberals committed to the public justification requirement – the requirement that public officials choose laws and policies that are justifiable to their citizens – should evaluate health states. Since the public justification requirement prohibits public officials from (...) appealing to controversial conceptions of the good life, liberals committed to this principle face a significant puzzle. (shrink)

This short paper defends Oliver Williamson’s (1993) claim that talk of trust is ‘redundant at best and can be misleading’ when trust is defined as a form of calculated risk (p. 463). And this paper accepts Williamson’s claim that ‘Calculative trust is a contradiction in terms’ (p. 463). But the present paper defends a conception of genuine, non-calculative trust that is compatible with calculative considerations and calculative antecedents. This conception of trust creates space for genuine (non-calculative) trust relationships in the (...) economic order—in which calculative considerations and antecedents (most often) play an essential role. (shrink)

Phenomenology and Quantum theory have defined themselves against the subject-object tradition of thought and against the modern objectivistic attempt to unify explanation of reality or being. Scientific technology and calculative way of thinking have prevailed over meditative and qualitative thinking in modern times. Despite scientific efforts to eliminate any inconsistency caused by metaphysical speculations and systems, in everyday life and science we encounter such phenomena which cannot be explained unambiguously and fully on the basis of purely conventional criteria. This paper (...) focuses on Bohr's framework of complementarity. The idea enables us exploring and describing a given phenomenon in such manner that we get adequate knowledge of the same phenomenon or subject of interest only by completing incompatible descriptions. (shrink)

The truth of every human being is the end his life with death, and this leads to leaving assets and funds for those after him and can lead to hate between the heirs, it has made a point of Islamic law on all aspects of life, including the subject of the inheritance of the deceased. The main problem is how to get the knowledge of the basics of inheritance. This paper reviews work done in the use of expert system software (...) to calculate inheritance in Islam. A proposed expert system was designed and developed using CLIPS language to calculate the inheritance in Islam. (shrink)

The debate between relationalism and representationalism in the philosophy of perception seems to have come to a standstill where opponents radically disagree on methodological principles or fundamental assumptions. According to Fish (this volume) this is because, not unlike Kuhnian scientific paradigms, the debate displays some elements of incommensurability. This diagnosis makes advancing the debate impossible. I argue that what is hindering progress is not a clash of research programmes, but a series of misunderstandings that can be avoided by disentangling the (...) different questions each theory is invested in and by making explicit the hidden assumptions at play in the debate. One such central assumption is what I call the Superficiality Constraint. This is the idea that the phenomenal character of experience is superficial with respect to introspection. I argue that we can make progress in the debate by assessing to what extent and at what cost relationalism can accommodate this constraint. (shrink)

In the future, when we compare the welfare of a being of one substrate (say, a human) with the welfare of another (say, an artificial intelligence system), we will be making an intersubstrate welfare comparison. In this paper, we argue that intersubstrate welfare comparisons are important, difficult, and potentially tractable. The world might soon contain a vast number of sentient or otherwise significant beings of different substrates, and moral agents will need to be able to compare their welfare levels. However, (...) this work will be difficult, because we lack the same kinds of commonalities across substrates that we have within them. Fortunately, we might be able to make at least some intersubstrate welfare comparisons responsibly in spite of these issues. We make the case for cautious optimism and call for more research. (shrink)

Les sciences cognitives poursuivent un objectif fort ancien, qui consiste, sommairement dit, à décrire et à expliquer les comportements intelligents. Elles appliquent à cet effet des principes méthodologiques moins traditionnels, dont l'adoption définit ce qu'il est convenu d'appeler le "tournant cognitif". Je me propose ici d'exposer brièvement ces principes, de les illustrer par des exemples appropriés et d’en discuter la signification philosophique. Pour l’essentiel, j’ai mis en avant un domaine qui me semble particulièrement pertinent pour les philosophes: l'analyse de la (...) catégorisation, c'est-à-dire du processus par lequel un ensemble d'entités (stimuli sonores ou visuels, objets concrets ou abstraits) en vient à être classifié en catégories séparées, qui peuvent être de type perceptif (phonèmes, couleurs) ou conceptuel (espèces naturelles, types d'événements, catégories esthétiques et morales). (shrink)

Johann Eck (1486–1543) has been introduced to modern scholarship as a prominent figure of the pre-Tridentine Counter-Reformation. As part of the curricular transformations of the University of Ingolstadt, he wrote commentaries on logical and scientific works by Aristotle and Peter of Spain. Utilising a variety of sources, the two volumes dedicated to physics and natural philosophy published in 1518 and 1519 were self-contained textbooks including annotated translations of the texts and quaestio-commentaries. These developed the doctrines of the Oxford Calculators mediated (...) through Continental sources, reproducing their conceptual and mathematical apparatus, including the famous middle degree theorem and Bradwardine’s law. (shrink)

We are on Mars again – the favourite laboratory for philosophical experiments. Our host colleagues introduce us to some Martian stuff referred to as “T”, and ask us to help them to identify T on other possible worlds. Or, technically speaking, we are asked to determine the intension of “T”, i.e., what the term designates with respect to different possible worlds. Following a short series of experiments on the planet, we conclude that the intension of “T” depends upon three factors: (...) (1) The semantic rule linked with the term, i.e., the way in which the term is designed to pick out its referent with respect to different possible worlds (e.g., as a definite description, or as a proper name, or as an actualised description etc.); (2) The properties of the referent of “T” in the actual world; and, (3) What we shall call ‘the metaphysical background of the universe’, i.e., what counts as a thing vs. what counts as a property of things (e.g., whether the universe is such that it contains material objects that merely happen to have their manifest properties, or whether the universe primarily contains manifest objects that merely happen to have their material constitution). As our experiments show, changing the values of any of these variables will result in a change in the reference of the term with respect to different possible worlds, viz., it will result in a change in the intension of the term. We then demonstrate how the three variables are interrelated, and specify how exactly they combine to produce a particular intension of a term. We conclude with a general “formula” that determines what will deserve to be called “T” relative to the different values of the above variables, i.e., we come up with a calculator of intensions. Finally, we also draw some morals about rigidity. (shrink)

Hauser argues that his pocket calculator (Cal) has certain arithmetical abilities: it seems Cal calculates. That calculating is thinking seems equally untendentious. Yet these two claims together provide premises for a seemingly valid syllogism whose conclusion - Cal thinks - most would deny. He considers several ways to avoid this conclusion, and finds them mostly wanting. Either we ourselves can't be said to think or calculate if our calculation-like performances are judged by the standards proposed to rule out Cal; or (...) the standards- e.g., autonomy and self-consciousness- make it impossible to verify whether anything or anyone (save oneself) meets them. While appeals to the intentionality of thought or the unity of minds provide more credible lines of resistance, available accounts of intentionality and mental unity are insufficiently clear and warranted to provide very substantial arguments against Cal's title to be called a thinking thing. Indeed, considerations favoring granting that title are more formidable than is generally appreciated. Rapaport's comments suggest that, on a strong view of thinking, mere calculating is not thinking (and pocket calculators don't think), but on a weak, but unexciting, sense of thinking, pocket calculators do think. He closes with some observations on the implications of this conclusion. (shrink)

Calculation is omnipresent in the current pandemic. And yet, Continental philosophers never talk about calculation: it seems to be the c** of philosophy. Why is that so? Has it always been like that?

Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...) ethics through the lens of computational complexity. First, we introduce computational complexity for the uninitiated reader and discuss how the complexity of ethical problems can be framed within Marr’s three levels of analysis. We then study a range of ethical problems based on consequentialism, deontology, and virtue ethics, with the aim of elucidating the complexity associated with the problems themselves (e.g., due to combinatorics, uncertainty, strategic dynamics), the computational methods employed (e.g., probability, logic, learning), and the available resources (e.g., time, knowledge, learning). The results indicate that most problems the normative frameworks pose lead to tractability issues in every category analyzed. Our investigation also provides several insights about the computational nature of normative ethics, including the differences between rule- and outcome-based moral strategies, and the implementation-variance with regard to moral resources. We then discuss the consequences complexity results have for the prospect of moral machines in virtue of the trade-off between optimality and efficiency. Finally, we elucidate how computational complexity can be used to inform both philosophical and cognitive-psychological research on human morality by advancing the moral tractability thesis. (shrink)

The present article proposes to study Condillac’s analysis of Spinoza’s Ethics, against the background of the more general criticism that the French abbot makes of the seventeenth-century logique de système. From the Essai sur l’origine des connaissances humaines to the Traité des systèmes to the later texts, Condillac’s theory and critique of systems are crossed by two components: on the one hand, the search for the sensory origin of ideas, that Condillac radicalizes in his Traité des sensations into a theory (...) of knowledge as a ‘transformed sensation’. On the other hand, an operative logic of signs, which from the Essai to the works subsequent to the Traité des sensations translates sensibility into a knowledge, or a ‘well-made language’, whose logic is calculation. My objective is to clarify how the new ‘systematic spirit’, repeatedly invoked by the abbot, departs from the ‘bad metaphysics’ that he claims to liquidate. The comparison with the Spinozist system will be illuminating: in his treatise on the metaphysical systems of the seventeenth century Condillac proposes a critical analysis of the ‘geometrical spirit’; in his latest work, La langue des calculs, he proposes a new logic to which he assigns the task of bringing together the abstract and the concrete, beyond the ruins of classical metaphysics. The ‘systematic spirit’ and ‘spirit of system’ will be revealed, in spite of Condillac’s efforts, as being much closer to what it appears at first sight. (shrink)

Are the real numbers rich enough to measure intelligence? We generalize a result of Alexander and Hutter about the so-called Legg-Hutter intelligence measures of reinforcement learning agents. Using the generalized result, we exhibit a paradox: in one particular version of the Legg-Hutter intelligence measure, certain agents all have intelligence 0, even though in a certain sense some of them outperform others. We show that this paradox disappears if we vary the Legg-Hutter intelligence measure to be hyperreal-valued rather than real-valued.

The work described in this report is motivated by the desire to test the expressive possibilities of action language C+. The Causal Calculator (CCalc) is a system that answers queries about action domains described in a fragment of that language. The Zoo World and the Traffic World have been proposed by Erik Sandewall in his Logic Modelling Workshop—an environment for communicating axiomatizations of action domains of nontrivial size. -/- The Zoo World consists of several cages and the exterior, gates between (...) them, and animals of several species, including humans. Actions in this domain include moving within and between cages, opening and closing gates, and mounting and riding animals. The Traffic World includes vehicles moving continuously between road crossings subject to a number of restrictions, such as speed limits and keeping a fixed safety distance away from other vehicles on the road. We show how to represent the two domains in the input language of CCalc, and how to use CCalc to test these representations. (shrink)

In this paper, we use antecedent-final conditionals to formulate two problems for parsing-based theories of presupposition projection and triviality of the kind given in Schlenker 2009. We show that, when it comes to antecedent-final conditionals, parsing-based theories predict filtering of presuppositions where there is in fact projection, and triviality judgments for sentences which are in fact felicitous. More concretely, these theories predict that presuppositions triggered in the antecedent of antecedent-final conditionals will be filtered (i.e. will not project) if the negation (...) of the consequent entails the presupposition. But this is wrong: John isn’t in Paris, if he regrets being in France intuitively presupposes that John is in France, contrary to this prediction. Likewise, parsing-based approaches to triviality predict that material entailed by the negation of the consequent will be redundant in the antecedent of the conditional; but John isn’t in Paris, if he’s in France and Mary is with him is intuitively felicitous, contrary to these predictions. Importantly, given that the trigger appears in sentence-final position, both incremental (left-to-right) and symmetric versions of such theories make the same predictions. These data constitute a challenge to the idea that presupposition projection and triviality should be computed on the basis of parsing. This issue is important because it relates to the more general question as to whether presupposition and triviality calculation should be thought of as a pragmatic post-compositional phenomenon or as part of compositional semantics (as in the more traditional dynamic approaches). We discuss a solution which allows us to maintain the parsing-based pragmatic approach; it is based on an analysis of conditionals which incorporates a presupposition that their antecedent is compatible with the context, together with a modification to Schlenker’s (2009) algorithm for calculating local contexts so that it takes into account presupposed material. As we will discuss, this solution works within a framework broadly similar to that of Schlenker’s (2009), but it doesn’t extend in an obvious way to other parsing-based accounts (e.g. parsing-based trivalent approaches). We conclude that a parsing-based theory can be maintained, but only if we adopt a substantial change of perspective on the framework. (shrink)

A number of examples have been given of physical systems (both classical and quantum mechanical) which when provided with a (continuously variable) computable input will give a non-computable output. It has been suggested that these systems might allow one to design analogue machines which would calculate the values of some number-theoretic non-computable function. Analysis of the examples show that the suggestion is wrong. In Section 4 I claim that given a reasonable definition of analogue machine it will always be wrong. (...) The claim is to be read not so much as a dogmatic assertion, but rather as a challenge. -/- In Sections 1 and 2 I discuss analogue machines, and lay down some conditions which I believe they must satisfy. In Section I discuss the particular forms which a paradigm undecidable problem (or non-computable function) may take. In Sections 5 and 6 I justify any claim for two particular examples lying within the range of classical physics, and in Section 7 I justify it for two (closely connected) examples from quantum mechanics, and discuss, very briefly, other possible quantum mechanical situations. Section 8 contains various remarks and comments. In Section 9 I consider the suggestion made by Penrose that a (future) theory of quantum gravity may predict non-locally-determined, and perhaps non-computable patterns of growth for microsopic structures. My conclusion is that such a theory will have to have non-computability built into it. (shrink)

In some recent papers (G. ‘t Hooft and others), it has been argued that quantum mechanics can arise from classical cellular automata. Nonetheless, G. Shpenkov has proved that the classical wave equation makes it possible to derive a periodic table of elements, which is very close to Mendeleyev’s one, and describe also other phenomena related to the structure of molecules. Hence the classical wave equation complements Schrödinger’s equation, which implies the appearance of a cellular automaton molecular model starting from classical (...) wave equation. The other studies show that the microworld is constituted as a tessellation of primary topological balls. The tessellattice becomes the origin of a submicrospic mechanics in which a quantum system is subdivided to two subsystems: the particle and its inerton cloud, which appears due to the interaction of the moving particle with oncoming cells of the tessellattice. The particle and its inerton cloud periodically change the momentum and hence move like a wave. The new approach allows us to correlate the Klein-Gordon equation with the deformation coat that is formed in the tessellatice around the particle. The submicroscopic approach shows that the source of any type of wave movements including the Klein-Gordon, Schrödinger, and classical wave equations is hidden in the tessellattice and its basic exciations – inertons, carriers of mass and inert properies of matter. We also discuss possible correspondence with Konrad Zuse’s calculating space. (shrink)

Purpose. The article aims to provide practical recommendations for calculating natural frequencies in axisymmetric shells using finite element methods. It focuses on the need to develop a simplified model that can be used in any modern finite element software package. The study analyzes the impact of the simplified homogeneous model on the deviation and error of natural frequencies compared to real structures. Design / Method / Approach. The research is based on creating a simplified shell geometry by determining parameters such (...) as shell thickness and density. These parameters are derived under the condition of equivalence in the moment of inertia and mass of the cross-sectional element. These parameters can vary along the height of the shell. Findings. The natural frequencies of the experimental shell with complex geometry were calculated and compared with those of the simplified model. The deviations and errors in the calculated frequencies were determined. It was demonstrated that the simplified model allows the calculation of natural frequencies with a deviation of no more than 1% from the experimental model, while significantly reducing computation time and the required computer resources. Theoretical Implications. The research expands the understanding of challenges in calculating the natural frequencies of complex objects using finite element methods under limited computational resources. Practical Implications. Practical recommendations are provided for engineers and designers when performing modeling tasks in the mechanics of deformable solid bodies. Originality / Value. The article presents an original analysis of a real case where a simplified model was implemented to determine the natural harmonics of a liquid rocket engine nozzle, making it a valuable tool for studying complex structures. Research Limitations / Future Research. The study is limited to the analysis of determining the natural frequencies of axisymmetric shells and does not cover all possible geometric features. Future research may focus on developing simplified models based on the equivalence of stiffness and mass parameters. Article Type. Case study, practical article. (shrink)

This book presents not only the mathematical concept of probability, but also its philosophical aspects, the relativity of probability and its applications and even the psychology of probability. All explanations are made in a comprehensible manner and are supported with suggestive examples from nature and daily life, and even with challenging math paradoxes.

When disability-adjusted life years are used to measure the burden of disease on a population in a time interval, they can be calculated in several different ways: from an incidence, pure prevalence, or hybrid perspective. I show that these calculation methods are not equivalent and discuss some of the formal difficulties each method faces. I show that if we don’t discount the value of future health, there is a sense in which the choice of calculation method is a mere question (...) of accounting. Such questions can be important, but they don’t raise deep theoretical concerns. If we do discount, however, choice of calculation method can change the relative burden attributed to different conditions over time. I conclude by recommending that studies involving disability-adjusted life years be explicit in noting what calculation method is being employed and in explaining why that calculation method has been chosen. (shrink)

Horizontal gene transfer (HGT) has been a paramount mechanism of interest in recent literature addressing the origins of biological evolution. However, research on lightning-triggered electroporation represents the innovative and still insufficiently grasped approach to HGT (Kotnik, 2013). On the other hand, prebiotic synthesis is a fundamental process for chemical evolution. Recently, the effects of volcanic lightning on nitrogen fixation and phosphate reduction have also been considered (NavarroGonzález and Segura, 2004). This paper aims to present a top-down approach to the question (...) of the origin of life on early Earth. By considering the conditions necessary for the emergence of biological and chemical evolution, emphasizing electrostatic discharges, we will attempt to link previous theoretical and experimental research. Furthermore, we will present a recent endeavor at applying the Drake equation to calculating the probability of volcanic lightning impact on the prebiotic synthesis and derive a similar use in estimating the contribution of lightning to HGT (Weaver, 2013). We will also display that choosing a type of probability appropriate for the context of life sciences is not necessarily a quantitative issue. Finally, we will show that significant conceptual constraints, like determining the relevant factors and sources of uncertainty when considering the origin of life on early Earth, are fundamentally philosophical issues. We hope that the results of our research – deriving Drake’s equation in the domain of chemical evolution and considering Bayesian and counterfactual types as potentially more suitable candidates for calculating probabilities in the evolutionary framework – will contribute to developing new discussions in life sciences. (shrink)

I aim to develop a tool for comparing theories of vagueness, using Structured Query Language. Relevant SQL snippets will be used throughout.

J’ai lu de nombreuses discussions récentes sur les limites du calcul et de l’univers en tant qu’ordinateur, dans l’espoir de trouver quelques commentaires sur le travail étonnant du physicien polymathe et théoricien de la décision David Wolpert, mais n’ont pas trouvé une seule citation et je présente donc ce résumé très bref. Wolpert s’est avéré quelques théoricaux d’impossibilité ou d’incomplétude renversants (1992 à 2008-voir arxiv dot org) sur les limites de l’inférence (computation) qui sont si généraux qu’ils sont indépendants de (...) l’appareil faisant le calcul, et même indépendamment des lois de la physique, ainsi ils s’appliquent à travers les ordinateurs, la physique, et le comportement humain. Ils utilisent la diagonalisation de Cantor, le paradoxe menteur et les worldlines (lignes du monde) pour fournir ce qui peut être le théorème ultime dans Turing Machine Theory, et apparemment fournir des aperçus de l’impossibilité, l’incomplétude, les limites du calcul, et l’univers comme ordinateur, dans tous les univers possibles et tous les êtres ou mécanismes possibles, générant, entre autres, un principe d’incertitude mécanique non quantique et une preuve de monothéisme. Il existe des connexions évidentes à l’œuvre classique de Chaitin, Solomonoff, Komolgarov et Wittgenstein et à l’idée qu’aucun programme (et donc aucun dispositif) ne peut générer une séquence (ou un dispositif) avec une plus grande complexité qu’il ne possède. On pourrait dire que cet ensemble de travaux implique l’athéisme puisqu’il ne peut y avoir d’entité plus complexe que l’univers physique et du point de vue wittgensteinien, « plus complexe » n’a aucun sens (n’a pas de conditions de satisfaction, c’est-à-dire véridique ou test). Même un « Dieu » (c’est-à-dire un « dispositif » avec un temps/ espace et une énergie illimité) ne peut pas déterminer si un « nombre » donné est « aléatoire», ni trouver un certain moyen de montrer qu’une « formule » donnée, un « théorème » ou une « phrase » ou un « dispositif » (tous ces jeux de langage complexes) fait partie d’un « système » particulier. Ceux qui souhaitent un cadre complet à jour pour le comportement humain de la vue moderne de deux systemes peuvent consulter mon livre 'The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle' 2nd ed (2019). Ceux qui s’intéressent à plus de mes écrits peuvent voir 'Talking Monkeys --Philosophie, Psychologie, Science, Religion et Politique sur une planète condamnée --Articles et revues 2006-2019 2ème ed (2019) et Suicidal Utopian Delusions in the 21st Century 4th ed (2019) et autres. (shrink)

Review of Dowek, Gilles, Computation, Proof, Machine, Cambridge University Press, Cambridge, 2015. Translation of Les Métamorphoses du calcul, Le Pommier, Paris, 2007. Translation from the French by Pierre Guillot and Marion Roman.

The main goal of the article is a further development of the usage of income and comparable approaches to company valuation aimed at defining market capitalization sensitivity to value changing in the conditions of dynamization of internal and external business parameters. The relevance of the researched topic is determined by the importance of establishing the factors influencing the change in company market capitalization based on the synthesis of approaches to company valuation. To obtain the results of the study, the following (...) methods were used: structural and logical analysis – to improve the process approach to company valuation in the context of determining the impact of its change on market capitalization; discounted cash flow method (DCF-model) – to determine the value of the enterprise based on the income approach; comparable companies method – to determine the value of the company on the basis of a market approach; factor analysis method – to assess the impact of changes in value on company market capitalization; generalization and logical analysis – in conclusions building. The results of critical analysis of publications of domestic and foreign scientists on the application of company valuation methods identified the need of improvement the process approach to company valuation in the context of determining the impact of its change on the company market capitalization. To adequately assess company value, the use of a synthesis of income and market approaches is proposed. The implementation of the DCF-model and comparable companies valuation method while valuation of Private Joint-Stock Company “SKF Ukraine” allowed to establish that the greatest impact on the target metric (company market capitalization) has an average industry multiplier EV/EBITDA, terminal growth rate and weighted average cost of capital – 5.9 %, 3.2% and 2.7% respectively. The practical value of the results of the study is determined by the importance of forming a full analytical basis for establishing the attractiveness of the performance of joint-stock companies in the market and consolidating management decisionsin order to increase market capitalization. (shrink)

The new kid on the block in cognitive science these days is dynamic systems. This way of thinking about the mind is, as usual, radically opposed to computationalism - - the hypothesis that thinking is computing. The use of dynamic systems is just the latest in a series of attempts, from Searle's Chinese Room Argument, through the weirdnesses of postmodernism, to overthrown computationalism, which as we all know is a perfectly nice hypothesis about the mind that never hurt anyone.

This is an appendix to the article "Wie effizient sollten Altruisten handeln?" ("How Efficient Should Altruists Act?") The appendix provides detailed moral efficiency calculations for two charitable projects: a children's home in Guatemala for neglected children versus malaria prevention by distributing mosquito nets in malaria areas in sub-Saharan Africa. The exact method of efficiency calculation is explained and applied. At least prima facie, the malaria prophylaxis project is clearly more efficient.

It seems to be a common and intuitively plausible assumption that conversational implicatures arise only when one of the so-called conversational maxims is violated at the level of what is said. The basic idea behind this thesis is that, unless a maxim is violated at the level of what is said, nothing can trigger the search for an implicature. Thus, non-violating implicatures wouldn’t be calculable. This paper defends the view that some conversational implicatures arise even though no conversational maxim is (...) violated at the level of what is said. (shrink)

The development of technology is unbelievably rapid. From limited local networks to high speed Internet, from crude computing machines to powerful semi-conductors, the world had changed drastically compared to just a few decades ago. In the constantly renewing process of adapting to such an unnaturally high-entropy setting, innovations as well as entirely new concepts, were often born. In the business world, one such phenomenon was the creation of a new type of entrepreneurship. This paper proposes a new academic discipline of (...) computational entrepreneurship, which centers on: (i) an exponentially growing (and less expensive) computing power, to the extent that almost everybody in a modern society can own and use that; (ii) omnipresent high-speed Internet connectivity, wired or wireless, representing our modern day’s economic connectomics; (iii) growing concern of exploiting “serendipity” for a strategic commercial advantage; and (iv) growing capabilities of lay people in performing calculations for their informed decisions in taking fast-moving entrepreneurial opportunities. Computational entrepreneurship has slowly become a new mode of operation for business ventures and will likely bring the academic discipline of entrepreneurship back to mainstream economics. (shrink)

Is calculation possible without language? Or is the human ability for arithmetic dependent on the language faculty? To clarify the relation between language and arithmetic, we studied numerical cognition in speakers of Mundurukú, an Amazonian language with a very small lexicon of number words. Although the Mundurukú lack words for numbers beyond 5, they are able to compare and add large approximate numbers that are far beyond their naming range. However, they fail in exact arithmetic with numbers larger than 4 (...) or 5. Our results imply a distinction between a nonverbal system of number approximation and a language-based counting system for exact number and arithmetic. (shrink)

Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might (...) implement the idea of "infinite calculation" is the main subject. (shrink)

What is reality? How do we know? Answers to these fundamental questions of ontology and epistemology, based on Mahatma Gandhi's "experiments with truth", are: reality is nonviolent (in the sense of not-inconsistent), and nonviolence (in the sense of respecting-meaning) is the only means of knowing (Gandhi, 1940). Be that as it may, science is what we think of when we think of reality and knowing. How does Gandhi's nonviolence, discovered in his spiritual quest for Truth, relate to the scientific pursuit (...) of truth? Here we show that Gandhian nonviolent knowing of nonviolent reality is an abstraction of both individual knowing (looking, reasoning) and collective scientific knowing (measurements, calculations). Specifically, Gandhi's truth-through-nonviolence is a law-like summation of the methods of physics ("do not disturb" of measurements) and of mathematics ("do not tear" of calculations) that are used to know. Moreover, physics (with its lawful behaviour of bodies) and biology (in preserving the meaning of genetic code) do affirm that the defining attribute of reality is nonviolence. In light of these correspondences, the Mahatma's derivation of a universal method of knowing (nonviolence of preserving-structure) from a universal truth (nonviolence of consistent-becoming) constitutes a science-supported general theory of reality and knowing. (shrink)

The paper proposes a method for approximating surfacing singularities of saddle maps using a sweeping net. The method involves constructing a densified sweeping subnet for each individual vertex of the saddle map, and then combining each subnet to create a complete approximation of the singularities. The authors also define two functions $f_1$ and $f_2$, which are used to calculate the charge density for each subnet. The resulting densified sweeping subnet closely approximates the surfacing saddle map near a circular region.

The Anscombean conception of intentional action endorses that an action's being intentional is in virtue of its internal structure, rather than any extra ingredient. Anscombe (2000) calls it the calculative order "that is there whenever actions are done with intentions," which features its teleological aspect. In his work reviving this tradition, Thompson (2008) highlights its temporal aspect. With the help of the concept "compound action," we shall see that typical intentional action attends to both aspects. The synthesis is met by (...) shifting from the aspect of action to agency. To act intentionally, an agent needs not only the capacity for calculating from a general end to a specific means, but also the capacity for planning: coordinate stages of different actions over time hierarchically, by occupying a certain kind of slots. (shrink)

Philosophers of science often make reference — whether tacitly or explicitly — to the notion of a scientific community. Sometimes, such references are useful to make our object of analysis tractable in the philosophy of science. For others, tracking or understanding particular features of the development of science proves to be tied to notions of a scientific community either as a target of theoretical or social intervention. We argue that the structure of contemporary scientific research poses two unappreciated, or at (...) least underappreciated, challenges to this concept of the “scientific community” in the philosophy of science. In particular, we will present two case studies from robotics research, broadly construed, which show that (1) the boundedness of the scientific community is threatened when private citizens can develop scientific and technological advances at minimal expense (democratization), and (2) the discreteness of scientific research programs is threatened by the complexly interrelated environment of contemporary scientific work (interconnectivity). Taken together, the extent of democratization and interconnectivity present a significant challenge for any practically oriented philosophy of science, one which we hope will be taken on directly by philosophers in the future. (shrink)

The notion of belief appears frequently in cognitive science. Yet it has resisted definition of the sort that could clarify inquiry. How then might a cognitive science of belief proceed? Here we propose a form of pluralism about believing. According to this view, there are importantly different ways to "believe" an idea. These distinct psychological kinds occur within a multi-dimensional property space, with different property clusters within that space constituting distinct varieties of believing. We propose that discovering such property clusters (...) is empirically tractable, and that this approach can help sidestep merely verbal disputes about what constitutes “belief.”. (shrink)

on calculating Apocalypse, awakening the Avatar, and related.