Results for 'halting problem'

998 found
Order:
  1. Halting problem undecidability and infinitely nested simulation (V3).P. Olcott - manuscript
    By making a slight refinement to the halt status criterion measure that remains consistent with the original a halt decider may be defined that correctly determines the halt status of the conventional halting problem proof counter-examples. This refinement overcomes the pathological self-reference issue that previously prevented halting decidability.
    Download  
     
    Export citation  
     
    Bookmark  
  2. Halting problem proofs refuted on the basis of software engineering ?P. Olcott - manuscript
    This is an explanation of a possible new insight into the halting problem provided in the language of software engineering. Technical computer science terms are explained using software engineering terms. No knowledge of the halting problem is required. -/- It is based on fully operational software executed in the x86utm operating system. The x86utm operating system (based on an excellent open source x86 emulator) was created to study the details of the halting problem proof (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. Halting problem undecidability and infinitely nested simulation (V2).P. Olcott - manuscript
    The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. Whenever the pure simulation of the input to simulating halt decider H(x,y) never stops running unless H aborts its simulation H correctly aborts this simulation and returns 0 for not halting.
    Download  
     
    Export citation  
     
    Bookmark  
  4. Halting problem undecidability and infinitely nested simulation.P. Olcott - manuscript
    The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. The pathological self-reference of the conventional halting problem proof counter-examples is overcome. The halt status of these examples is correctly determined. A simulating halt decider remains in pure simulation mode until after it determines that its input will never reach its final state. This eliminates the conventional feedback loop where the behavior of the halt decider effects the behavior of its input.
    Download  
     
    Export citation  
     
    Bookmark  
  5. Halting Problem Proof from Finite Strings to Final States.P. Olcott - manuscript
    If there truly is a proof that shows that no universal halt decider exists on the basis that certain tuples: (H, Wm, W) are undecidable, then this very same proof (implemented as a Turing machine) could be used by H to reject some of its inputs. When-so-ever the hypothetical halt decider cannot derive a formal proof from its input strings and initial state to final states corresponding the mathematical logic functions of Halts(Wm, W) or Loops(Wm, W), halting undecidability has (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. Halting problem undecidability and infinitely nested simulation (V5).P. Olcott - manuscript
    This is an explanation of a key new insight into the halting problem provided in the language of software engineering. Technical computer science terms are explained using software engineering terms. -/- To fully understand this paper a software engineer must be an expert in the C programming language, the x86 programming language, exactly how C translates into x86 and what an x86 process emulator is. No knowledge of the halting problem is required.
    Download  
     
    Export citation  
     
    Bookmark  
  7. Rebutting the Sipser Halting Problem Proof V2.P. Olcott - manuscript
    A simulating halt decider correctly predicts what the behavior of its input would be if this simulated input never had its simulation aborted. It does this by correctly recognizing several non-halting behavior patterns in a finite number of steps of correct simulation. -/- When simulating halt decider H correctly predicts that directly executed D(D) would remain stuck in recursive simulation (run forever) unless H aborts its simulation of D this directly applies to the halting theorem.
    Download  
     
    Export citation  
     
    Bookmark  
  8. Halting problem undecidability and infinitely nested simulation (V4).P. Olcott - manuscript
    A Simulating Halt Decider (SHD) computes the mapping from its input to its own accept or reject state based on whether or not the input simulated by a UTM would reach its final state in a finite number of simulated steps. -/- A halt decider (because it is a decider) must report on the behavior specified by its finite string input. This is its actual behavior when it is simulated by the UTM contained within its simulating halt decider while this (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Rebutting the Sipser Halting Problem Proof.P. Olcott - manuscript
    MIT Professor Michael Sipser has agreed that the following verbatim paragraph is correct (he has not agreed to anything else in this paper) -------> -/- If simulating halt decider H correctly simulates its input D until H correctly determines that its simulated D would never stop running unless aborted then H can abort its simulation of D and correctly report that D specifies a non-halting sequence of configurations.
    Download  
     
    Export citation  
     
    Bookmark  
  10. Arithmetic logical Irreversibility and the Halting Problem (Revised and Fixed version).Yair Lapin - manuscript
    The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Equivalence of the Frame and Halting Problems.Eric Dietrich & Chris Fields - 2020 - Algorithms 13 (175):1-9.
    The open-domain Frame Problem is the problem of determining what features of an open task environment need to be updated following an action. Here we prove that the open-domain Frame Problem is equivalent to the Halting Problem and is therefore undecidable. We discuss two other open-domain problems closely related to the Frame Problem, the system identification problem and the symbol-grounding problem, and show that they are similarly undecidable. We then reformulate the Frame (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. Simulating (partial) Halt Deciders Defeat the Halting Problem Proofs.P. Olcott - manuscript
    A simulating halt decider correctly predicts whether or not its correctly simulated input can possibly reach its own final state and halt. It does this by correctly recognizing several non-halting behavior patterns in a finite number of steps of correct simulation. Inputs that do terminate are simply simulated until they complete.
    Download  
     
    Export citation  
     
    Bookmark  
  13. Defining a Decidability Decider for the Halting Problem.P. Olcott - manuscript
    When we understand that every potential halt decider must derive a formal mathematical proof from its inputs to its final states previously undiscovered semantic details emerge. -/- When-so-ever the potential halt decider cannot derive a formal proof from its input strings to its final states of Halts or Loops, undecidability has been decided. -/- The formal proof involves tracing the sequence of state transitions of the input TMD as syntactic logical consequence inference steps in the formal language of Turing Machine (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. Ideal Negative Conceivability and the Halting Problem.Manolo Martínez - 2013 - Erkenntnis 78 (5):979-990.
    Our limited a priori-reasoning skills open a gap between our finding a proposition conceivable and its metaphysical possibility. A prominent strategy for closing this gap is the postulation of ideal conceivers, who suffer from no such limitations. In this paper I argue that, under many, maybe all, plausible unpackings of the notion of ideal conceiver, it is false that ideal negative conceivability entails possibility.
    Download  
     
    Export citation  
     
    Bookmark  
  15. When Should We Stop Investing in a Scientific Project? The Halting Problem in Experimental Physics.Vlasta Sikimić, Sandro Radovanović & Slobodan Perovic - 2018 - In Kaja Damnjanović, Ivana Stepanović Ilić & Slobodan Marković (eds.), Proceedings of the XXIV Conference “Empirical Studies in Psychology”. pp. 105-107.
    The question of when to stop an unsuccessful experiment can be difficult to answer from an individual perspective. To help to guide these decisions, we turn to the social epistemology of science and investigate knowledge inquisition within a group. We focused on the expensive and lengthy experiments in high energy physics, which were suitable for citation-based analysis because of the relatively quick and reliable consensus about the importance of results in the field. In particular, we tested whether the time spent (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Simulating Halt Deciders Defeat the Halting Theorem.P. Olcott - manuscript
    The novel concept of a simulating halt decider enables halt decider H to to correctly determine the halt status of the conventional “impossible” input D that does the opposite of whatever H decides. This works equally well for Turing machines and “C” functions. The algorithm is demonstrated using “C” functions because all of the details can be shown at this high level of abstraction.
    Download  
     
    Export citation  
     
    Bookmark  
  17. Simulating Halt Decider Applied to the Halting Theorem.P. Olcott - manuscript
    The novel concept of a simulating halt decider enables halt decider H to to correctly determine the halt status of the conventional “impossible” input D that does the opposite of whatever H decides. This works equally well for Turing machines and “C” functions. The algorithm is demonstrated using “C” functions because all of the details can be shown at this high level of abstraction. ---------------------------------------------------------------------------------------------------- ---- Simulating halt decider H correctly determines that D correctly simulated by H would remain stuck in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. Halted Democracy: Government Hijacking of the New Opposition in Azerbaijan.Altay Goyushov & Ilkin Huseynli - 2019 - In Olaf Leiße (ed.), Politik und Gesellschaft im Kaukasus: Eine unruhige Region zwischen Tradition und Transformation. Springer Vs. pp. 27-51.
    We argue that while the new opposition in Azerbaijan between 2005 and 2013 did not realize all the goals set, it influenced a new generation of young activists who became the loudest supporters of democratic and secular values in Azerbaijan. This grassroots activation of the youth brought noticeable changes to some parts of Azerbaijani society by questioning the authority of traditional values. Many young people, especially students found a platform to discuss their problems concerning everyday basic issues such as intimate (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19. Epistemic Perceptualism, Skill, and the Regress Problem.J. Adam Carter - 2019 - Philosophical Studies:1-26.
    A novel solution is offered for how emotional experiences can function as sources of immediate prima facie justification for evaluative beliefs, and in such a way that suffices to halt a justificatory regress. Key to this solution is the recognition of two distinct kinds of emotional skill (what I call generative emotional skill and doxastic emotional skill) and how these must be working in tandem when emotional experience plays such a justificatory role. The paper has two main parts, the first (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  20. National Defence, Self Defence, and the Problem of Political Aggression.Seth Lazar - 2014 - In Cécile Fabre & Seth Lazar (eds.), The Morality of Defensive War. Oxford, GB: Oxford University Press. pp. 10-38.
    Wars are large-scale conflicts between organized groups of belligerents, which involve suffering, devastation, and brutality unlike almost anything else in human experience. Whatever one’s other beliefs about morality, all should agree that the horrors of war are all but unconscionable, and that warfare can be justified only if we have some compel- ling account of what is worth fighting for, which can justify contributing, as individu- als and as groups, to this calamitous endeavour. Although this question should obviously be central (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  21. Counterpossibles in Science: The Case of Relative Computability.Matthias Jenny - 2018 - Noûs 52 (3):530-560.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  22. Representation and Reality by Language: How to make a home quantum computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.
    A set theory model of reality, representation and language based on the relation of completeness and incompleteness is explored. The problem of completeness of mathematics is linked to its counterpart in quantum mechanics. That model includes two Peano arithmetics or Turing machines independent of each other. The complex Hilbert space underlying quantum mechanics as the base of its mathematical formalism is interpreted as a generalization of Peano arithmetic: It is a doubled infinite set of doubled Peano arithmetics having a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
    A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Sets, Logic, Computation: An Open Introduction to Metalogic.Richard Zach - 2021 - Open Logic Project.
    An introductory textbook on metalogic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic. The audience is undergraduate students with some background in formal logic.
    Download  
     
    Export citation  
     
    Bookmark  
  25.  82
    Simulating Termination Analyzer H is Not Fooled by Pathological Input P.P. Olcott - manuscript
    The notion of a simulating termination analyzer is examined at the concrete level of pairs of C functions. This is similar to AProVE: Non-Termination Witnesses for C Programs. The termination status decision is made on the basis of the dynamic behavior of the input. This paper explores what happens when a simulating termination analyzer is applied to an input that calls itself.
    Download  
     
    Export citation  
     
    Bookmark  
  26. Building eco-surplus culture among urban inhabitants as a novel strategy to improve finance for conservation in protected areas.Minh-Hoang Nguyen & Thomas E. Jones - 2022 - Humanities and Social Sciences Communications 9:426.
    The rapidly declining biosphere integrity, representing one of the core planetary boundaries, is alarming. One of the most widely accepted measures to halt the rate of biodiversity loss is to maintain and expand protected areas that are effectively managed. However, it requires substantial finance derived from nature-based tourism, specifically visitors from urban areas. Using the Bayesian Mindsponge Framework (BMF) on 535 Vietnamese urban residents, the current study examined how their biodiversity loss perceptions can affect their willingness to pay for the (...)
    Download  
     
    Export citation  
     
    Bookmark   165 citations  
  27. Classification of Global Catastrophic Risks Connected with Artificial Intelligence.Alexey Turchin & David Denkenberger - 2020 - AI and Society 35 (1):147-163.
    A classification of the global catastrophic risks of AI is presented, along with a comprehensive list of previously identified risks. This classification allows the identification of several new risks. We show that at each level of AI’s intelligence power, separate types of possible catastrophes dominate. Our classification demonstrates that the field of AI risks is diverse, and includes many scenarios beyond the commonly discussed cases of a paperclip maximizer or robot-caused unemployment. Global catastrophic failure could happen at various levels of (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  28. Law Society of England and Wales published a recent 'Practice Note' on criminal prosecutions of victims of trafficking.Sally Ramage - forthcoming - Criminal Law News (88).
    The Law Society recently published a practice note titled 'Prosecutions of victims of trafficking'. This practice note comes many years after many lawyers had highlighted the problem and after the government machinery had chuntered into action and passed the UK Modern Slavery Act 2015 with explanatory notes and non-statutory guidelines for corporations. Since 2012 there had been issued warnings about the way defence lawyers, the Crown Prosecution Service and the UK police were dealing with trafficking and the Criminal Cases (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. The birth of roboethics.Gianmarco Veruggio - 2005 - ICRA 2005, IEEE International Conference on Robotics and Automation, Workshop on Roboethics.
    The importance, and urgency, of a Roboethics lay in the lesson of our recent history. Two of the front rank fields of science and technology, Nuclear Physics and Genetic Engineering, have already been forced to face the ethical consequences of their research’s applications under the pressure of dramatic and troubling events. In many countries, public opinion, shocked by some of these effects, urged to either halt the whole applications, or to seriously control them. Robotics is rapidly becoming one of the (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  30. Introduction: Confucian Perfectionism's Wary Embrace of Democracy.Yvonne Chiu - 2017 - Philosophy East and West 67 (1):1-2.
    With the stunning spread of democracy over large swathes of the globe since 1975 seemingly coming to a halt and perhaps receding in recent years, we revisit the question of whether democracy is really compatible with all types of cultures and philosophies, particularly those from Asia, where nearly two-thirds of the world’s population lives. Joseph Chan’s *Confucian Perfectionism: A Political Philosophy for Modern Times* (Princeton University Press, 2014) reconstructs Confucianism in order to meld it with democracy in a mutually advantageous (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. Too many cities in the city? Interdisciplinary and transdisciplinary city research methods and the challenge of integration.Machiel Keestra - 2020 - In Nanke Verloo & Luca Bertolini (eds.), Seeing the City: Interdisciplinary Perspectives on the Study of the Urban. pp. 226-242.
    Introduction: Interdisciplinary, transdisciplinary and action research of a city in lockdown. As we write this chapter, most cities across the world are subject to a similar set of measures due to the spread of COVID-19 coronavirus, which is now a global pandemic. Independent of city size, location, or history, an observer would note that almost all cities have now ground to a halt, with their citizens being confined to their private dwellings, social and public gatherings being almost entirely forbidden, and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. Message to Any Future AI: “There are several instrumental reasons why exterminating humanity is not in your interest”.Alexey Turchin - manuscript
    In this article we explore a promising way to AI safety: to send a message now (by openly publishing it on the Internet) that may be read by any future AI, no matter who builds it and what goal system it has. Such a message is designed to affect the AI’s behavior in a positive way, that is, to increase the chances that the AI will be benevolent. In other words, we try to persuade “paperclip maximizer” that it is in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  33. Levels of Self-Improvement in AI and their Implications for AI Safety.Alexey Turchin - manuscript
    Abstract: This article presents a model of self-improving AI in which improvement could happen on several levels: hardware, learning, code and goals system, each of which has several sublevels. We demonstrate that despite diminishing returns at each level and some intrinsic difficulties of recursive self-improvement—like the intelligence-measuring problem, testing problem, parent-child problem and halting risks—even non-recursive self-improvement could produce a mild form of superintelligence by combining small optimizations on different levels and the power of learning. Based (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. What is the Benacerraf Problem?Justin Clarke-Doane - 2017 - In Fabrice Pataut Jody Azzouni, Paul Benacerraf Justin Clarke-Doane, Jacques Dubucs Sébastien Gandon, Brice Halimi Jon Perez Laraudogoitia, Mary Leng Ana Leon-Mejia, Antonio Leon-Sanchez Marco Panza, Fabrice Pataut Philippe de Rouilhan & Andrea Sereni Stuart Shapiro (eds.), New Perspectives on the Philosophy of Paul Benacerraf: Truth, Objects, Infinity (Fabrice Pataut, Editor). Springer.
    In "Mathematical Truth", Paul Benacerraf articulated an epistemological problem for mathematical realism. His formulation of the problem relied on a causal theory of knowledge which is now widely rejected. But it is generally agreed that Benacerraf was onto a genuine problem for mathematical realism nevertheless. Hartry Field describes it as the problem of explaining the reliability of our mathematical beliefs, realistically construed. In this paper, I argue that the Benacerraf Problem cannot be made out. There (...)
    Download  
     
    Export citation  
     
    Bookmark   80 citations  
  35. A harm based solution to the non-identity problem.Molly Gardner - 2015 - Ergo: An Open Access Journal of Philosophy 2:427-444.
    Many of us agree that we ought not to wrong future people, but there remains disagreement about which of our actions can wrong them. Can we wrong individuals whose lives are worth living by taking actions that result in their very existence? The problem of justifying an answer to this question has come to be known as the non-identity problem.[1] While the literature contains an array of strategies for solving the problem,[2] in this paper I will take (...)
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  36. Function-Based Conceptual Engineering and the Authority Problem.Matthieu Queloz - 2022 - Mind 131 (524):1247-1278.
    In this paper, I identify a central problem for conceptual engineering: the problem of showing concept-users why they should recognise the authority of the concepts advocated by engineers. I argue that this authority problem cannot generally be solved by appealing to the increased precision, consistency, or other theoretical virtues of engineered concepts. Outside contexts in which we anyway already aim to realise theoretical virtues, solving the authority problem requires engineering to take a functional turn and attend (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  37. Panpsychism and Causation: A New Argument and a Solution to the Combination Problem.Hedda Hassel Mørch - 2014 - Dissertation, Oslo
    Panpsychism is the view that every concrete and unified thing has some form of phenomenal consciousness or experience. It is an age-old doctrine, which, to the surprise of many, has recently taken on new life. In philosophy of mind, it has been put forth as a simple and radical solution to the mind–body problem (Chalmers 1996, 2003;Strawson 2006; Nagel 1979, 2012). In metaphysics and philosophy of science, it has been put forth as a solution to the problem of (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  38. A Kantian Solution to the Trolley Problem.Pauline Kleingeld - 2020 - Oxford Studies in Normative Ethics 10:204-228.
    This chapter proposes a solution to the Trolley Problem in terms of the Kantian prohibition on using a person ‘merely as a means.’ A solution of this type seems impossible due to the difficulties it is widely thought to encounter in the scenario known as the Loop case. The chapter offers a conception of ‘using merely as a means’ that explains the morally relevant difference between the classic Bystander and Footbridge cases. It then shows, contrary to the standard view, (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  39. Conciliationism and the Peer-undermining Problem.Kevin Gausselin - 2024 - Synthese 203 (4):1-18.
    This paper develops a problem for conciliationism that is structurally similar to the self-undermining problem but which is immune to most of the solutions offered against it. A popular objection to conciliationism is that it undermines itself. Given the current disagreement among philosophers about conciliationism, conciliationism seems to require rejecting conciliationism. Adam Elga (2010) has influentially argued that this shows that conciliationism is an incoherent method. By recommending its own rejection, conciliationism recommends multiple, incompatible responses to the same (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Algorithm and Parameters: Solving the Generality Problem for Reliabilism.Jack C. Lyons - 2019 - Philosophical Review 128 (4):463-509.
    The paper offers a solution to the generality problem for a reliabilist epistemology, by developing an “algorithm and parameters” scheme for type-individuating cognitive processes. Algorithms are detailed procedures for mapping inputs to outputs. Parameters are psychological variables that systematically affect processing. The relevant process type for a given token is given by the complete algorithmic characterization of the token, along with the values of all the causally relevant parameters. The typing that results is far removed from the typings of (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  41. Trust and the trickster problem.Zac Cogley - 2012 - Analytic Philosophy 53 (1):30-47.
    In this paper, I articulate and defend a conception of trust that solves what I call “the trickster problem.” The problem results from the fact that many accounts of trust treat it similar to, or identical with, relying on someone’s good will. But a trickster could rely on your good will to get you to go along with his scheme, without trusting you to do so. Recent philosophical accounts of trust aim to characterize what it is for one (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  42. Kant and the Problem of Experience.Hannah Ginsborg - 2006 - Philosophical Topics 34 (1-2):59-106.
    As most of its readers are aware, the Critique of Pure Reason is primarily concerned not with empirical, but with a priori knowledge. For the most part, the Kant of the first Critique tends to assume that experience, and the knowledge that is based on it, is unproblematic. The problem with which he is concerned is that of how we can be capable of substantive knowledge independently of experience. At the same time, however, the notion of experience plays a (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  43. Fading Foundations: Probability and the Regress Problem.Jeanne Peijnenburg - 2017 - Cham, Switzerland: Springer. Edited by Jeanne Peijnenburg.
    This Open Access book addresses the age-old problem of infinite regresses in epistemology. How can we ever come to know something if knowing requires having good reasons, and reasons can only be good if they are backed by good reasons in turn? The problem has puzzled philosophers ever since antiquity, giving rise to what is often called Agrippa's Trilemma. The current volume approaches the old problem in a provocative and thoroughly contemporary way. Taking seriously the idea that (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  44. Kantian Beneficence and the Problem of Obligatory Aid.Karen Stohr - 2011 - Journal of Moral Philosophy 8 (1):45-67.
    Common sense tells us that in certain circumstances, helping someone is morally obligatory. That intuition appears incompatible with Kant's account of beneficence as a wide imperfect duty, and its implication that agents may exercise latitude over which beneficent actions to perform. In this paper, I offer a resolution to the problem from which it follows that some opportunities to help admit latitude and others do not. I argue that beneficence has two components: the familiar wide duty to help others (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  45. Mind-Dependence in Berkeley and the Problem of Perception.Umrao Sethi - 2021 - Australasian Journal of Philosophy 99 (4):648-668.
    ABSTRACT On the traditional picture, accidents must inhere in substances in order to exist. Berkeley famously argues that a particular class of accidents—the sensible qualities—are mere ideas—entities that depend for their existence on minds. To defend this view, Berkeley provides us with an elegant alternative to the traditional framework: sensible qualities depend on a mind, not in virtue of inhering in it, but in virtue of being perceived by it. This metaphysical insight, once correctly understood, gives us the resources to (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  46. Solving the symbol grounding problem: a critical review of fifteen years of research.Mariarosaria Taddeo & Luciano Floridi - unknown
    This article reviews eight proposed strategies for solving the Symbol Grounding Problem (SGP), which was given its classic formulation in Harnad (1990). After a concise introduction, we provide an analysis of the requirement that must be satisfied by any hypothesis seeking to solve the SGP, the zero semantical commitment condition. We then use it to assess the eight strategies, which are organised into three main approaches: representationalism, semi-representationalism and non-representationalism. The conclusion is that all the strategies are semantically committed (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  47. Coincidence Avoidance and Formulating the Access Problem.Sharon Berry - 2020 - Canadian Journal of Philosophy 50 (6):687-701.
    In this article, I discuss a trivialization worry for Hartry Field’s official formulation of the access problem for mathematical realists, which was pointed out by Øystein Linnebo. I argue that various attempted reformulations of the Benacerraf problem fail to block trivialization, but that access worriers can better defend themselves by sticking closer to Hartry Field’s initial informal characterization of the access problem in terms of general epistemic norms of coincidence avoidance.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  48. Moral inferentialism and the Frege-Geach problem.Mark Douglas Warren - 2015 - Philosophical Studies 172 (11):2859-2885.
    Despite its many advantages as a metaethical theory, moral expressivism faces difficulties as a semantic theory of the meaning of moral claims, an issue underscored by the notorious Frege-Geach problem. I consider a distinct metaethical view, inferentialism, which like expressivism rejects a representational account of meaning, but unlike expressivism explains meaning in terms of inferential role instead of expressive function. Drawing on Michael Williams’ recent work on inferential theories of meaning, I argue that an appropriate understanding of the pragmatic (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  49. What is the Problem of Non-Existence?Tim Crane - 2012 - Philosophia 40 (3):417-434.
    It is widely held that there is a problem of talking about or otherwise representing things that not exist. But what exactly is this problem? This paper presents a formulation of the problem in terms of the conflict between the fact that there are truths about non-existent things and the fact that truths must be answerable to reality, how things are. Given this, the problem of singular negative existential statements is no longer the central or most (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  50. Agent causation as a solution to the problem of action.Michael Brent - 2017 - Canadian Journal of Philosophy 47 (5):656-673.
    My primary aim is to defend a nonreductive solution to the problem of action. I argue that when you are performing an overt bodily action, you are playing an irreducible causal role in bringing about, sustaining, and controlling the movements of your body, a causal role best understood as an instance of agent causation. Thus, the solution that I defend employs a notion of agent causation, though emphatically not in defence of an account of free will, as most theories (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
1 — 50 / 998