Results for 'finite-state automata'

968 found
Order:
  1. Michelangelo, the Duck and the Rabbit: Towards a Robust Account of Modes of Existence.Juan Felipe Miranda Medina & Marisol Cristel Galarza Flores - 2020 - Public Journal of Semiotics 9 (2):1-29.
    The concept of modes of existence of semiotic entities underlies (post)Greimasian semiotics, yet it seems to have received little attention. Modes of existence can be used in different senses. For Greimas, from the perspective of narrative semiotics, when Michelangelo first receives a block of marble and decides to sculpt the David, his intention is in a virtual mode; as Michelangelo progresses he ends up bringing the David into existence, and his intention comes to the realized mode. In Fontanille’s tensive semiotics, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. Dynamic systems as tools for analysing human judgement.Joachim Funke - 2001 - Thinking and Reasoning 7 (1):69 – 89.
    With the advent of computers in the experimental labs, dynamic systems have become a new tool for research on problem solving and decision making. A short review of this research is given and the main features of these systems (connectivity and dynamics) are illustrated. To allow systematic approaches to the influential variables in this area, two formal frameworks (linear structural equations and finite state automata) are presented. Besides the formal background, the article sets out how the task (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  3. Why computers can't feel pain.John Mark Bishop - 2009 - Minds and Machines 19 (4):507-516.
    The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988 ) monograph, “Representation & Reality”, which if correct, has (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  4. Theory of Finite Automata: With an Introduction to Formal Languages.John Carroll & Darrell Long - 1989
    Theory of Computation -- Computation by Abstracts Devices.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  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. The impossibility of a satisfactory population prospect axiology (independently of Finite Fine-Grainedness).Elliott Thornley - 2021 - Philosophical Studies 178 (11):3671-3695.
    Arrhenius’s impossibility theorems purport to demonstrate that no population axiology can satisfy each of a small number of intuitively compelling adequacy conditions. However, it has recently been pointed out that each theorem depends on a dubious assumption: Finite Fine-Grainedness. This assumption states that there exists a finite sequence of slight welfare differences between any two welfare levels. Denying Finite Fine-Grainedness makes room for a lexical population axiology which satisfies all of the compelling adequacy conditions in each theorem. (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  7. On classical finite probability theory as a quantum probability calculus.David Ellerman - manuscript
    This paper shows how the classical finite probability theory (with equiprobable outcomes) can be reinterpreted and recast as the quantum probability calculus of a pedagogical or "toy" model of quantum mechanics over sets (QM/sets). There are two parts. The notion of an "event" is reinterpreted from being an epistemological state of indefiniteness to being an objective state of indefiniteness. And the mathematical framework of finite probability theory is recast as the quantum probability calculus for QM/sets. The (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. (1 other version)Quantum mechanics over sets: a pedagogical model with non-commutative finite probability theory as its quantum probability calculus.David Ellerman - 2017 - Synthese (12).
    This paper shows how the classical finite probability theory (with equiprobable outcomes) can be reinterpreted and recast as the quantum probability calculus of a pedagogical or toy model of quantum mechanics over sets (QM/sets). There have been several previous attempts to develop a quantum-like model with the base field of ℂ replaced by ℤ₂. Since there are no inner products on vector spaces over finite fields, the problem is to define the Dirac brackets and the probability calculus. The (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  48
    Learnability of state spaces of physical systems is undecidable.Petr Spelda & Vit Stritecky - 2024 - Journal of Computational Science 83 (December 2024):1-7.
    Despite an increasing role of machine learning in science, there is a lack of results on limits of empirical exploration aided by machine learning. In this paper, we construct one such limit by proving undecidability of learnability of state spaces of physical systems. We characterize state spaces as binary hypothesis classes of the computable Probably Approximately Correct learning framework. This leads to identifying the first limit for learnability of state spaces in the agnostic setting. Further, using the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. Adaptive Control using Nonlinear Autoregressive-Moving Average-L2 Model for Realizing Neural Controller for Unknown Finite Dimensional Nonlinear Discrete Time Dynamical Systems.Mustefa Jibril, Mesay Tadesse & Nurye Hassen - 2021 - Journal of Engineering and Applied Sciences 16 (3):130-137.
    This study considers the problem of using approximate way for realizing the neural supervisor for nonlinear multivariable systems. The Nonlinear Autoregressive-Moving Average (NARMA) model is an exact transformation of the input-output behavior of finite-dimensional nonlinear discrete time dynamical organization in a hoodlum of the equilibrium state. However, it is not convenient for intention of adaptive control using neural networks due to its nonlinear dependence on the control input. Hence, quite often, approximate technique are used for realizing the neural (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Cosmos is a (fatalistic) state machine: Objective theory (cosmos, objective reality, scientific image) vs. Subjective theory (consciousness, subjective reality, manifest image).Xiaoyang Yu - manuscript
    As soon as you believe an imagination to be nonfictional, this imagination becomes your ontological theory of the reality. Your ontological theory (of the reality) can describe a system as the reality. However, actually this system is only a theory/conceptual-space/imagination/visual-imagery of yours, not the actual reality (i.e., the thing-in-itself). An ontological theory (of the reality) actually only describes your (subjective/mental) imagination/visual-imagery/conceptual-space. An ontological theory of the reality, is being described as a situation model (SM). There is no way to prove/disprove (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. Relation between neurophysiological and mental states: possible limits of decodability.Alfred Gierer - 1983 - Naturwissenschaften 70:282-287.
    Validity of physical laws for any aspect of brain activity and strict correlation of mental to physical states of the brain do not imply, with logical necessity, that a complete algorithmic theory of the mind-body relation is possible. A limit of decodability may be imposed by the finite number of possible analytical operations which is rooted in the finiteness of the world. It is considered as a fundamental intrinsic limitation of the scientific approach comparable to quantum indeterminacy and the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  13. From Analog to Digital Computing: Is Homo sapiens’ Brain on Its Way to Become a Turing Machine?Antoine Danchin & André A. Fenton - 2022 - Frontiers in Ecology and Evolution 10:796413.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. Counterfactuals cannot count: A rejoinder to David Chalmers.John Mark Bishop - 2002 - Consciousness and Cognition 11 (4):642-652.
    The initial argument presented herein is not significantly original—it is a simple reflection upon a notion of computation originally developed by Putnam and criticised by Chalmers et al. . In what follows, instead of seeking to justify Putnam’s conclusion that every open system implements every Finite State Automaton and hence that psychological states of the brain cannot be functional states of a computer, I will establish the weaker result that, over a finite time window every open system (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  15. Rational Delay.Abelard Podgorski - 2017 - Philosophers' Imprint 17.
    Finite agents such as human beings have reasoning and updating processes that are extended in time; consequently, there is always some lag between the point at which we gain new reasons and the point at which our attitudes have fully responded to those reasons. This phenomenon, which I call rational delay, poses a threat to the most common ways of formulating rational requirements on our attitudes, which do not allow rational beings to exhibit such delay. In this paper, I (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  16. Introducing Exclusion Logic as a Deontic Logic.Richard Evans - 2010 - DEON 2010 10 (1):179-195.
    This paper introduces Exclusion Logic - a simple modal logic without negation or disjunction. We show that this logic has an efficient decision procedure. We describe how Exclusion Logic can be used as a deontic logic. We compare this deontic logic with Standard Deontic Logic and with more syntactically restricted logics.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  17. An Outline of Cellular Automaton Universe via Cosmological KdV equation.Victor Christianto, Florentin Smarandache & Yunita Umniyati - manuscript
    It has been known for long time that the cosmic sound wave was there since the early epoch of the Universe. Signatures of its existence are abound. However, such a sound wave model of cosmology is rarely developed fully into a complete framework. This paper can be considered as our second attempt towards such a complete description of the Universe based on soliton wave solution of cosmological KdV equation. Then we advance further this KdV equation by virtue of Cellular Automaton (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. Hilbert's 10th Problem for solutions in a subring of Q.Agnieszka Peszek & Apoloniusz Tyszka - 2019 - Scientific Annals of Computer Science 29 (1):101-111.
    Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19. Adaptive Intelligent Tutoring System for learning Computer Theory.Mohammed A. Al-Nakhal & Samy S. Abu Naser - 2017 - European Academic Research 4 (10).
    In this paper, we present an intelligent tutoring system developed to help students in learning Computer Theory. The Intelligent tutoring system was built using ITSB authoring tool. The system helps students to learn finite automata, pushdown automata, Turing machines and examines the relationship between these automata and formal languages, deterministic and nondeterministic machines, regular expressions, context free grammars, undecidability, and complexity. During the process the intelligent tutoring system gives assistance and feedback of many types in an (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  20. Hobbes's Leviathan: New Science of Man.Christopher Lazarski - 2013 - In Janusz Grygiensl (ed.), Human Rights and Politics. Erida.
    Leviathan by Hobbes is one of the most original books in political theory ever written. Broad is scope, rich in ideas and bold in its claims; it contains much more than just political theory. The article focuses on Hobbes’s presentation of human nature, in particular in light of the then new thesis that universe is matter in motion; on observation how human automata whom Hobbes created (as it were) live in state of nature and under authority of “the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. Blockchain Philosophy - Bitcoin.Nicolae Sfetcu - manuscript
    State features are affected by the connection with digital coins. Social systems create their own limits and remain alive according to their internal logic, which does not derive from the system environment. So, social systems are operationally and autonomously closed - interacting with their environment and there is a general increase in entropy, but individual systems work to maintain and preserve their internal order. Autopoietic systems (like the state, with the tendency to maintain the inner order with a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. Statements and open problems on decidable sets X⊆N that contain informal notions and refer to the current knowledge on X.Apoloniusz Tyszka - 2022 - Journal of Applied Computer Science and Mathematics 16 (2):31-35.
    Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a (...) number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)
    Download  
     
    Export citation  
     
    Bookmark  
  23. Models in the Geosciences.Alisa Bokulich & Naomi Oreskes - 2017 - In Magnani Lorenzo & Bertolotti Tommaso Wayne (eds.), Springer Handbook of Model-Based Science. Springer. pp. 891-911.
    The geosciences include a wide spectrum of disciplines ranging from paleontology to climate science, and involve studies of a vast range of spatial and temporal scales, from the deep-time history of microbial life to the future of a system no less immense and complex than the entire Earth. Modeling is thus a central and indispensable tool across the geosciences. Here, we review both the history and current state of model-based inquiry in the geosciences. Research in these fields makes use (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  24. The Epistemology of Forgetting.Kourken Michaelian - 2011 - Erkenntnis 74 (3):399-424.
    The default view in the epistemology of forgetting is that human memory would be epistemically better if we were not so susceptible to forgetting—that forgetting is in general a cognitive vice. In this paper, I argue for the opposed view: normal human forgetting—the pattern of forgetting characteristic of cognitively normal adult human beings—approximates a virtue located at the mean between the opposed cognitive vices of forgetting too much and remembering too much. I argue, first, that, for any finite cognizer, (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  25. Adaptive ITS for Learning Computer Theory.Mohamed Nakhal & Bastami Bashhar - 2017 - European Academic Research 4 (10):8770-8782.
    In this paper, we present an intelligent tutoring system developed to help students in learning Computer Theory. The Intelligent tutoring system was built using ITSB authoring tool. The system helps students to learn finite automata, pushdown automata, Turing machines and examines the relationship between these automata and formal languages, deterministic and nondeterministic machines, regular expressions, context free grammars, undecidability, and complexity. During the process the intelligent tutoring system gives assistance and feedback of many types in an (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. Impossible Worlds and the Logic of Imagination.Francesco Berto - 2017 - Erkenntnis 82 (6):1277-1297.
    I want to model a finite, fallible cognitive agent who imagines that p in the sense of mentally representing a scenario—a configuration of objects and properties—correctly described by p. I propose to capture imagination, so understood, via variably strict world quantifiers, in a modal framework including both possible and so-called impossible worlds. The latter secure lack of classical logical closure for the relevant mental states, while the variability of strictness captures how the agent imports information from actuality in the (...)
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  27. Three Moral Themes of Leibniz's Spiritual Machine Between "New System" and "New Essays".Markku Roinila - 2023 - le Present Est Plein de L’Avenir, Et Chargé du Passé : Vorträge des Xi. Internationalen Leibniz-Kongresses, 31. Juli – 4. August 2023.
    The advance of mechanism in science and philosophy in the 17th century created a great interest to machines or automata. Leibniz was no exception - in an early memoir Drôle de pensée he wrote admiringly about a machine that could walk on water, exhibited in Paris. The idea of automatic processing in general had a large role in his thought, as can be seen, for example, in his invention of the binary code and the so-called Calculemus!-model for solving controversies. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28. An infinity of super-Belnap logics.Umberto Rivieccio - 2012 - Journal of Applied Non-Classical Logics 22 (4):319-335.
    We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  29. Jewish Themes in Spinoza's Philosophy (review).Yisrael Yehoshua Melamed - 2003 - Journal of the History of Philosophy 41 (3):417-418.
    In lieu of an abstract, here is a brief excerpt of the content:Journal of the History of Philosophy 41.3 (2003) 417-418 [Access article in PDF] Heidi M. Ravven and Lenn E. Goodman, editors. Jewish Themes in Spinoza's Philosophy. Albany: The State University of New York Press, 2002. Pp. ix + 290. Cloth, $78.50. Paper, $26.95.The current anthology presents an important contribution to the study of Spinoza's relation to Jewish philosophy as well as to contemporary scholarship of Spinoza's metaphysics and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. A Revolutionary New Metaphysics, Based on Consciousness, and a Call to All Philosophers.Lorna Green - manuscript
    June 2022 A Revolutionary New Metaphysics, Based on Consciousness, and a Call to All Philosophers We are in a unique moment of our history unlike any previous moment ever. Virtually all human economies are based on the destruction of the Earth, and we are now at a place in our history where we can foresee if we continue on as we are, our own extinction. As I write, the planet is in deep trouble, heat, fires, great storms, and record flooding, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. My Life Gives the Moral Landscape its Relief.Marc Champagne - 2023 - In Sandra Woien (ed.), Sam Harris: Critical Responses. Chicago: Carus Books. pp. 17–38.
    Sam Harris (2010) argues that, given our neurology, we can experience well-being, and that seeking to maximize this state lets us distinguish the good from the bad. He takes our ability to compare degrees of well-being as his starting point, but I think that the analysis can be pushed further, since there is a (non-religious) reason why well-being is desirable, namely the finite life of an individual organism. It is because death is a constant possibility that things can (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  32. Philosophy of Probability: Foundations, Epistemology, and Computation.Sylvia Wenmackers - 2011 - Dissertation, University of Groningen
    This dissertation is a contribution to formal and computational philosophy. -/- In the first part, we show that by exploiting the parallels between large, yet finite lotteries on the one hand and countably infinite lotteries on the other, we gain insights in the foundations of probability theory as well as in epistemology. Case 1: Infinite lotteries. We discuss how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. The solution boils down to (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  33. A Simpler and More Realistic Subjective Decision Theory.Haim Gaifman & Yang Liu - 2018 - Synthese 195 (10):4205--4241.
    In his classic book “the Foundations of Statistics” Savage developed a formal system of rational decision making. The system is based on (i) a set of possible states of the world, (ii) a set of consequences, (iii) a set of acts, which are functions from states to consequences, and (iv) a preference relation over the acts, which represents the preferences of an idealized rational agent. The goal and the culmination of the enterprise is a representation theorem: Any preference relation that (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  34. On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.
    This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with Zeno-machines , i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zeno-machines falls into a dilemma: either they are specified (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  35. Remarks on the Geometry of Complex Systems and Self-Organization.Luciano Boi - 2012 - In Vincenzo Fano, Enrico Giannetto, Giulia Giannini & Pierluigi Graziani (eds.), Complessità e Riduzionismo. ISONOMIA - Epistemologica Series Editor. pp. 28-43.
    Let us start by some general definitions of the concept of complexity. We take a complex system to be one composed by a large number of parts, and whose properties are not fully explained by an understanding of its components parts. Studies of complex systems recognized the importance of “wholeness”, defined as problems of organization (and of regulation), phenomena non resolvable into local events, dynamics interactions in the difference of behaviour of parts when isolated or in higher configuration, etc., in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. Modal Logics for Parallelism, Orthogonality, and Affine Geometries.Philippe Balbiani & Valentin Goranko - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):365-397.
    We introduce and study a variety of modal logics of parallelism, orthogonality, and affine geometries, for which we establish several completeness, decidability and complexity results and state a number of related open, and apparently difficult problems. We also demonstrate that lack of the finite model property of modal logics for sufficiently rich affine or projective geometries (incl. the real affine and projective planes) is a rather common phenomenon.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  37. Does von Neumann Entropy Correspond to Thermodynamic Entropy?Eugene Y. S. Chua - 2021 - Philosophy of Science 88 (1):145-168.
    Conventional wisdom holds that the von Neumann entropy corresponds to thermodynamic entropy, but Hemmo and Shenker (2006) have recently argued against this view by attacking von Neumann's (1955) argument. I argue that Hemmo and Shenker's arguments fail due to several misunderstandings: about statistical-mechanical and thermodynamic domains of applicability, about the nature of mixed states, and about the role of approximations in physics. As a result, their arguments fail in all cases: in the single-particle case, the finite particles case, and (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  38. An inexplicably good argument for causal finitism.Ibrahim Dagher - 2023 - International Journal for Philosophy of Religion 94 (2):199-211.
    Causal finitism, the view that the causal history of any event must be finite, has garnered much philosophical interest recently—especially because of its applicability to the Kalām cosmological argument. The most prominent argument for causal finitism is the Grim Reaper argument, which attempts to show that, if infinite causal histories are possible, then other paradoxical states of affairs must also be possible. However, this style of argument has been criticized on the grounds of (i) relying on controversial modal principles, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Kant on Education and evil—Perfecting human beings with an innate propensity to radical evil.Klas Roth & Paul Formosa - 2018 - Educational Philosophy and Theory 51 (13):1304-1307.
    Kant begins his Lectures on Pedagogy by stating, “[t]he human being is the only creature that must be educated” (Kant, 2007, 9:441), and he argues that it is through education that we can transform our initial “animal nature into human nature” (ibid. 2007, 9:441). Kant understands education as involving an ordered process of care, discipline, instruction and formation through enculturating, civilizing and moralizing (Formosa 2011). Further, Kant envisages that we should pursue as a species the “moral perfection” that is the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  40. Aristotle's 'Cosmic Nose' Argument for the Uniqueness of the World.Tim O'Keefe & Harald Thorsrud - 2003 - Apeiron 36 (4):311 - 326.
    David Furley's work on the cosmologies of classical antiquity is structured around what he calls "two pictures of the world." The first picture, defended by both Plato and Aristotle, portrays the universe, or all that there is (to pan), as identical with our particular ordered world-system. Thus, the adherents of this view claim that the universe is finite and unique. The second system, defended by Leucippus and Democritus, portrays an infinite universe within which our particular kosmos is only one (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  41. Aptness and means-end coherence: a dominance argument for causal decision theory.J. Robert G. Williams - 2023 - Synthese 201 (2):1-19.
    Why should we be means-end rational? Why care whether someone’s mental states exhibit certain formal patterns, like the ones formalized in causal decision theory? This paper establishes a dominance argument for these constraints in a finite setting. If you violate the norms of causal decision theory, then your desires will be aptness dominated. That is, there will be some alternative set of desires that you could have had, which would be more apt (closer to the actual values fixed by (...)
    Download  
     
    Export citation  
     
    Bookmark  
  42. To Bite or Not to Bite: Twilight, Immortality, and the Meaning of Life.Brendan Shea - 2009 - In William Irwin, Rebecca Housel & J. Jeremy Wisnewski (eds.), Twilight and Philosophy: Vampires, Vegetarians, and the Pursuit of Immortality. Wiley. pp. 79-93.
    Over the course of the Twilight series, Bella strives to and eventually succeeds in convincing Edward to turn her into a vampire. Her stated reason for this is that it will allow her to be with Edward forever. In this essay, I consider whether this type of immortality is something that would be good for Bella, or indeed for any of us. I begin by suggesting that Bella's own viewpoint is consonant with that of Leo Tolstoy, who contends that one (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  43. Relative Clauses in Amaka Azuike’s ‘Violated’.Innocent Nasuk Dajang & Patricia Nathan Bwai - 2023 - Universal Journal of Educational Research 2 (3):258-267.
    This study examined the usage of the relative clause as a wealthy, crucial and complicated syntactic procedure in modern English Literature through the examination of Amaka Azuike’s Violated, a short play. The study determined the use of relative clauses in terms of their frequency of occurrence and type used, and it showed that English language speakers mostly attempt to use the "easier" type of the relative clauses to combine sentences for clarity of relaying messages. The paper extracted examples of relative (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44. On the Derivation and Meaning of Spinoza's Conatus Doctrine.Valtteri Viljanen - 2008 - Oxford Studies in Early Modern Philosophy 4:89-112.
    In this paper I begin by discussing the different ways in which Spinoza’s famous conatus argument has been understood, after which I present my own reconstruction of the derivation: each and every true finite thing is, in itself, an expresser of power (E1p25c, 1p34) that never acts self-destructively (E3p4) but instead strives to drive itself through opponents to produce effects as they follow from the definition of the thing in question (E1p25c, 1p34, and 3p5). This tells us something decisive (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  45. The White Sun of Substance: Spinozism and the Psychedelic Amor Dei Intellectualis.Peter Sjostedt-Hughes - 2022 - In Christine Hauskeller & Peter Sjöstedt-Hughes (eds.), Philosophy and Psychedelics: Frameworks for Exceptional Experience. Bloomsbury Academic. pp. 211-235.
    Experiences of enlightened unity with Nature or with Deity are reported not only in the mystical literature of the past but also in contemporary accounts of the psychedelic adventurer. In Chapter 13, Peter Sjöstedt-Hughes seeks to fathom such reported states within the framework of the metaphysics of Benedict de Spinoza – a metaphysics encompassing monism, pantheism, panpsychism, and the eternal substance: the timelessness of pure Nature, God itself. God is Nature for Spinoza. To achieve this framework, the tenets of Spinozism (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  46. Matter as Information. Quantum Information as Matter.Vasil Penchev - 2016 - Nodi. Collana di Storia Della Filosofia 2016 (2):127-138.
    Quantum information is discussed as the universal substance of the world. It is interpreted as that generalization of classical information, which includes both finite and transfinite ordinal numbers. On the other hand, any wave function and thus any state of any quantum system is just one value of quantum information. Information and its generalization as quantum information are considered as quantities of elementary choices. Their units are correspondingly a bit and a qubit. The course of time is what (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  47. J N MOHANTY (Jiten/Jitendranath) In Memoriam.David Woodruff- Smith & Purushottama Bilimoria - 2023 - Https://Www.Apaonline.Org/Page/Memorial_Minutes2023.
    J. N. (Jitendra Nath) Mohanty (1928–2023). -/- Professor J. N. Mohanty has characterized his life and philosophy as being both “inside” and “outside” East and West, i.e., inside and outside traditions of India and those of the West, living in both India and United States: geographically, culturally, and philosophically; while also traveling the world: Melbourne to Moscow. Most of his academic time was spent teaching at the University of Oklahoma, The New School Graduate Faculty, and finally Temple University. Yet his (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. There’s Plenty of Boole at the Bottom: A Reversible CA Against Information Entropy.Francesco Berto, Jacopo Tagliabue & Gabriele Rossi - 2016 - Minds and Machines 26 (4):341-357.
    “There’s Plenty of Room at the Bottom”, said the title of Richard Feynman’s 1959 seminal conference at the California Institute of Technology. Fifty years on, nanotechnologies have led computer scientists to pay close attention to the links between physical reality and information processing. Not all the physical requirements of optimal computation are captured by traditional models—one still largely missing is reversibility. The dynamic laws of physics are reversible at microphysical level, distinct initial states of a system leading to distinct final (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  49. (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  50. The c-aplpha Non Exclusion Principle and the vastly different internal electron and muon center of charge vacuum fluctuation geometry.Jim Wilson - forthcoming - Physics Essays.
    The electronic and muonic hydrogen energy levels are calculated very accurately [1] in Quantum Electrodynamics (QED) by coupling the Dirac Equation four vector (c ,mc2) current covariantly with the external electromagnetic (EM) field four vector in QED’s Interactive Representation (IR). The c -Non Exclusion Principle(c -NEP) states that, if one accepts c as the electron/muon velocity operator because of the very accurate hydrogen energy levels calculated, the one must also accept the resulting electron/muon internal spatial and time coordinate operators (ISaTCO) (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 968