Results for 'automata state machines'

981 found
Order:
  1.  45
    R. McNaughton and H. Yamada. Regular expressions and state graphs for automata. Sequential machines, Selected papers, edited by Edward F. Moore, Addison-Wesley Publishing Company, Inc., Reading, Massachusetts, Palo Alto, and London, 1964, pp. 157–174. , pp. 39–47.). [REVIEW]Andrzej J. Blikle - 1967 - Journal of Symbolic Logic 32 (3):390-391.
  2. Cellular automata.Francesco Berto & Jacopo Tagliabue - 2012 - Stanford Encyclopedia of Philosophy.
    Cellular automata (henceforth: CA) are discrete, abstract computational systems that have proved useful both as general models of complexity and as more specific representations of non-linear dynamics in a variety of scientific fields. Firstly, CA are (typically) spatially and temporally discrete: they are composed of a finite or denumerable set of homogeneous, simple units, the atoms or cells. At each time unit, the cells instantiate one of a finite set of states. They evolve in parallel at discrete time steps, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  3. Machine models for cognitive science.Raymond J. Nelson - 1987 - Philosophy of Science 54 (September):391-408.
    Introduction. During the past two decades philosophers of psychology have considered a large variety of computational models for philosophy of mind and more recently for cognitive science. Among the suggested models are computer programs, Turing machines, pushdown automata, linear bounded automata, finite state automata and sequential machines. Many philosophers have found finite state automata models to be the most appealing, for various reasons, although there has been no shortage of defenders of programs (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   38 citations  
  4.  81
    Shannon Claude E.. A universal Turing machine with two internal states. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 157–165. [REVIEW]Patrick C. Fischer - 1971 - Journal of Symbolic Logic 36 (3):532.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5. 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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  11
    Turing's World 3.0 for Mac: An Introduction to Computability Theory.Jon Barwise & John Etchemendy - 1993 - Center for the Study of Language and Information Publications.
    Turing's World is a self-contained introduction to Turing machines, one of the fundamental notions of logic and computer science. The text and accompanying diskette allow the user to design, debug, and run sophisticated Turing machines in a graphical environment on the Macintosh. Turning's World introduces users to the key concpets in computability theory through a sequence of over 100 exercises and projects. Within minutes, users learn to build simple Turing machines using a convenient package of graphical functions. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  7. Igor Aleksander, Impossible Minds. [REVIEW]Richard Wilson - 1998 - Journal of Consciousness Studies 5 (1):115-115.
    Igor Aleksander has spent many years developing artificial neural networks of a special category called weightless - the elements are effectively chunks of computer memory - which show interesting and useful properties. In this book he gives us an overview of his research leading to his "basic guess" about consciousness: he thinks that the brain is a neural state machine, the activity of this machine is the mind, a subset of which is conscious. I leave it to the reader (...)
     
    Export citation  
     
    Bookmark  
  8.  18
    Infinite strings and their large scale properties.Bakh Khoussainov & Toru Takisaka - 2022 - Journal of Symbolic Logic 87 (2):585-625.
    The aim of this paper is to shed light on our understanding of large scale properties of infinite strings. We say that one string $\alpha $ has weaker large scale geometry than that of $\beta $ if there is color preserving bi-Lipschitz map from $\alpha $ into $\beta $ with small distortion. This definition allows us to define a partially ordered set of large scale geometries on the classes of all infinite strings. This partial order compares large scale geometries of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9. PDL with intersection and converse: satisfiability and infinite-state model checking.Stefan Göller, Markus Lohrey & Carsten Lutz - 2009 - Journal of Symbolic Logic 74 (1):279-314.
    We study satisfiability and infinite-state model checking in ICPDL, which extends Propositional Dynamic Logic (PDL) with intersection and converse operators on programs. The two main results of this paper are that (i) satisfiability is in 2EXPTIME, thus 2EXPTIME-complete by an existing lower bound, and (ii) infinite-state model checking of basic process algebras and pushdown systems is also 2EXPTIME-complete. Both upper bounds are obtained by polynomial time computable reductions to ω-regular tree satisfiability in ICPDL, a reasoning problem that we (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. Automata, man-machines and embodiment: deflating or inflating Life?Charles T. Wolfe - forthcoming - In A. Radman & H. Sohn, Critical and Clinical Cartographies: Architecture, Robotics, Medicine, Philosophy. Edinburgh University Press.
    Early modern automata, understood as efforts to ‘model’ life, to grasp its singular properties and/or to unveil and demystify its seeming inaccessibility and mystery, are not just fascinating liminal, boundary, hybrid, crossover or go-between objects, while they are all of those of course. They also pose a direct challenge to some of our common conceptions about mechanism and embodiment. They challenge the simplicity of the distinction between a purported ‘mechanistic’ worldpicture, its ontology and its goals, and on the other (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  11. A guarded fragment for abstract state machines.Antje Nowack - 2005 - Journal of Logic, Language and Information 14 (3):345-368.
    Abstract State Machines (ASMs) provide a formal method for transparent design and specification of complex dynamic systems. They combine advantages of informal and formal methods. Applications of this method motivate a number of computability and decidability problems connected to ASMs. Such problems result for example from the area of verifying properties of ASMs. Their high expressive power leads rather directly to undecidability respectively uncomputability results for most interesting problems in the case of unrestricted ASMs. Consequently, it is rather (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark  
  12.  12
    Функціональний успіх інтелектуальних автоматів.Alexander Mayevsky - 2020 - Наукові Записки Наукма. Філософія Та Релігієзнавство 5:15-25.
    Based on the standpoint close to that of philosophical functionalism, the paper addresses the history and present state of scientific research on artificial reconstruction of some of the rational thinking functions, and acquisition of valid knowledge of phenomenally given actuality, by way of engineering artificial intelligent automata. Thereby, the author examines the settings of emergence of an attendant basic ontology, and the place of logic in the process of knowing, by intelligent automata and humans, accordingly. Analysis and (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  32
    A new view of REA state machine.Frantisek Hunka & Jaroslav Zacek - 2015 - Applied ontology 10 (1):25-39.
    The presented paper proposes a state machine of REA (Resource–Event–Agent) model. This model constitutes a fundamental building block for value modeling applications. Contrary to other appr...
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14.  9
    Proceedings of the 1986 Conference on Theoretical Aspects of Reasoning about Knowledge: March 19-22, 1988, Monterey, California.Joseph Y. Halpern, International Business Machines Corporation, American Association of Artificial Intelligence, United States & Association for Computing Machinery - 1986
    Direct download  
     
    Export citation  
     
    Bookmark  
  15. 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 (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  16.  53
    Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.
    Kummer's Cardinality Theorem states that a language A must be recursive if a Turing machine can exclude for any n words ω1...., ωn one of the n + 1 possibilities for the cardinality of {ω1...., ωn} ∩ A. There was good reason to believe that this theorem is a peculiarity of recursion theory: neither the Cardinality Theorem nor weak forms of it hold for resource-bounded computational models like polynomial time. This belief may be flawed. In this paper it is shown (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  17.  37
    Abstract State Machines: a unifying view of models of computation and of system design frameworks.Egon Börger - 2005 - Annals of Pure and Applied Logic 133 (1-3):149-171.
    We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study.1.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  18.  43
    On the Kolmogorov-Chaitin complexity for short sequences.Hector Zenil - unknown
    This is a presentation about joint work between Hector Zenil and Jean-Paul Delahaye. Zenil presents Experimental Algorithmic Theory as Algorithmic Information Theory and NKS, put together in a mixer. Algorithmic Complexity Theory defines the algorithmic complexity k(s) as the length of the shortest program that produces s. But since finding this short program is in general an undecidable question, the only way to approach k(s) is to use compression algorithms. He shows how to use the Compress function in Mathematica to (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  19.  71
    Decision Theory with Resource‐Bounded Agents.Joseph Y. Halpern, Rafael Pass & Lior Seeman - 2014 - Topics in Cognitive Science 6 (2):245-257.
    There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein (), charges an agent for doing costly computation; the second, initiated by Neyman (), does not charge for computation, but limits the computation that agents can do, typically by modeling agents as finite automata. We review recent work on applying both approaches in the context of decision theory. For the first approach, we take the objects of choice in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  20.  26
    Why Computers Can’t Feel Pain.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 monograph, “Representation & Reality”, which if correct, has important implications for turing machine functionalism and the prospect (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  21.  16
    Evolutionary Games in Natural, Social, and Virtual Worlds.Daniel Friedman & Barry Sinervo - 2016 - Oxford University Press USA.
    Over the last 25 years, evolutionary game theory has grown with theoretical contributions from the disciplines of mathematics, economics, computer science and biology. It is now ripe for applications. In this book, Daniel Friedman---an economist trained in mathematics---and Barry Sinervo---a biologist trained in mathematics---offer the first unified account of evolutionary game theory aimed at applied researchers. They show how to use a single set of tools to build useful models for three different worlds: the natural world studied by biologists; the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  22. A Simplicity Criterion for Physical Computation.Tyler Millhouse - 2019 - British Journal for the Philosophy of Science 70 (1):153-178.
    The aim of this paper is to offer a formal criterion for physical computation that allows us to objectively distinguish between competing computational interpretations of a physical system. The criterion construes a computational interpretation as an ordered pair of functions mapping (1) states of a physical system to states of an abstract machine, and (2) inputs to this machine to interventions in this physical system. This interpretation must ensure that counterfactuals true of the abstract machine have appropriate counterparts which are (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  23.  25
    Tapping into the senses: Corporeality and immanence in The Piano Tuner of EarthQuakes.Fátima Chinita - 2019 - Empedocles European Journal for the Philosophy of Communication 10 (2):151-166.
    In The Piano Tuner of EarthQuakes, the Quay Brothers' second feature, the sensual form and the meta-artistic content are truly interweaved, and the siblings' staple animated materials become part of the theme itself. Using Michel Serres's argument in Les cinq sens, I address the relationship between the Quays intermedial animation and the way the art forms of music, painting, theatre and sculpture are used to captivate the film viewer's sensorium in the same way that some of the characters are fascinated (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  24.  52
    Tranquillity's Secret.James M. Corrigan - 2023 - Medium.
    Tranquillity’s Secret Presents A New Understanding Of The World And Ourselves, And A Forgotten Meditation Technique That Protects You From Traumatic Harm. There Is A Way Of Seeing The World Different. -/- My goal in this book is two-fold: to introduce a revolutionary paradigm for understanding ourselves and the world; and to explain an ancient meditation technique that brought me to the insights upon which it is founded. This technique appears in different forms in the extant spiritual and religious traditions (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  38
    Decidable properties for monadic abstract state machines.Daniele Beauquier - 2006 - Annals of Pure and Applied Logic 141 (3):308-319.
    The paper describes a decidable class of verification problems expressed in first order timed logic. To specify programs we useState Machines. It is known that Abstract State Machines and first order timed logic are two very powerful formalisms apt to represent verification problems for timed distributed systems. However, the general verification problem represented in this way is undecidable. Prior, some decidable classes of verification problems were described in semantical properties that are in their turn undecidable. The decidable (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  26.  41
    Christiaan Huygens's Attitude toward Animals.Nathaniel Wolloch - 2000 - Journal of the History of Ideas 61 (3):415-432.
    In lieu of an abstract, here is a brief excerpt of the content:Journal of the History of Ideas 61.3 (2000) 415-432 [Access article in PDF] Christiaan Huygens's Attitude toward Animals Nathaniel Wolloch The debate on the status of animals has interested people since ancient times. In the early modern era this debate reached one of its most historically important and sedulous stages, drawing the attention of some of the most famous minds in Europe. Curiously enough, the historiography of this debate (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  27. The instructional information processing account of digital computation.Nir Fresco & Marty J. Wolf - 2014 - Synthese 191 (7):1469-1492.
    What is nontrivial digital computation? It is the processing of discrete data through discrete state transitions in accordance with finite instructional information. The motivation for our account is that many previous attempts to answer this question are inadequate, and also that this account accords with the common intuition that digital computation is a type of information processing. We use the notion of reachability in a graph to defend this characterization in memory-based systems and underscore the importance of instructional information (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  28.  10
    Impossible minds: my neurons, my consciousness.Igor Aleksander - 2014 - New Jersey: Imperial College Press.
    Impossible Minds: My Neurons, My Consciousness has been written to satisfy the curiosity each and every one of us has about our own consciousness. It takes the view that the neurons in our heads are the source of consciousness and attempts to explain how this happens. Although it talks of neural networks, it explains what they are and what they do in such a way that anyone may understand. While the topic is partly philosophical, the text makes no assumptions of (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  29.  23
    “Recovery” in mental health services, now and then: A poststructuralist examination of the despotic State machine's effects.Jim A. Johansson & Dave Holmes - 2024 - Nursing Inquiry 31 (1):e12558.
    Recovery is a model of care in (forensic) mental health settings across Western nations that aims to move past the paternalistic and punitive models of institutional care of the 20th century and toward more patient‐centered approaches. But as we argue in this paper, the recovery‐oriented services that evolved out of the early stages of this liberating movement signaled a shift in nursing practices that cannot be viewed only as improvements. In effect, as “recovery” nursing practices became more established, more codified, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  30.  3
    The explanation dialogues: an expert focus study to understand requirements towards explanations within the GDPR.Laura State, Alejandra Bringas Colmenarejo, Andrea Beretta, Salvatore Ruggieri, Franco Turini & Stephanie Law - forthcoming - Artificial Intelligence and Law:1-60.
    Explainable AI (XAI) provides methods to understand non-interpretable machine learning models. However, we have little knowledge about what legal experts expect from these explanations, including their legal compliance with, and value against European Union legislation. To close this gap, we present the Explanation Dialogues, an expert focus study to uncover the expectations, reasoning, and understanding of legal experts and practitioners towards XAI, with a specific focus on the European General Data Protection Regulation. The study consists of an online questionnaire and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  41
    Finite State Automata and Monadic Definability of Singular Cardinals.Itay Neeman - 2008 - Journal of Symbolic Logic 73 (2):412 - 438.
    We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formula over the ordinals.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  32.  30
    The depoliticization of law in the news: BBC reporting on US use of extraterritorial or ‘long-arm’ law against China. Le Cheng, Xiaobin Zhu & David Machin - 2023 - Critical Discourse Studies 20 (3):306-319.
    ABSTRACT In this paper we explore how a public national media outlet, the British BBC, represents an international legal case which has a highly political nature. The case is US versus Huawei/meng Wanzhou, which took place between 2018 and 2021. Accusations were that the Chinese technology company committed fraud, leading the global HSBC bank to breach US sanctions against Iran. The charges were made by the US using what is called an ‘extraterritorial law’, which, while rejected as law by governments (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33. 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, (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  34.  43
    Turing Machines, Finite Automata and Neural Nets.Michael A. Arbib - 1970 - Journal of Symbolic Logic 35 (3):482-482.
    Direct download  
     
    Export citation  
     
    Bookmark   27 citations  
  35.  30
    (1 other version)Automata techniques for query inference machines.William Gasarch & Geoffrey R. Hird - 2002 - Annals of Pure and Applied Logic 117 (1-3):169-201.
    In prior papers the following question was considered: which classes of computable sets can be learned if queries about those sets can be asked by the learner? The answer depended on the query language chosen. In this paper we develop a framework for studying this question. Essentially, once we have a result for queries to [S,<]2, we can obtain the same result for many different languages. We obtain easier proofs of old results and several new results. An earlier result we (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  36.  65
    Finite state automata and simple recurrent networks.Axel Cleeremans & David Servan-Schreiber - unknown
    We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step 25-1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the network has a minimal number of hidden units, patterns on the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   22 citations  
  37. (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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  38.  28
    Categorizing Automata by W-machine Programs.C. Y. Lee, Seiiti Huzino & Mariko Yoneyama - 1968 - Journal of Symbolic Logic 33 (4):628-628.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  27
    Towards an immortal political body: the state machine in eighteenth-century English political discourse.Pasi Ihalainen - 2009 - Contributions to the History of Concepts 5 (1):4-47.
  40.  33
    (1 other version)Arden Dean N.. Delayed-logic and finite-state machines. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17–20, 1961, and papers from the First Annual Symposium, Chicago, III., October 9–14,1960, American Institute of Electrical Engineers, New York 1961, pp. 133–151. [REVIEW]Robert McNaughton - 1971 - Journal of Symbolic Logic 36 (1):151-151.
  41. The experience machine and mental state theories of well-being.Jason Kawall - 1999 - Journal of Value Inquiry 33 (3):381-387.
    It is argued that Nozick's experience machine thought experiment does not pose a particular difficulty for mental state theories of well-being. While the example shows that we value many things beyond our mental states, this simply reflects the fact that we value more than our own well-being. Nor is a mental state theorist forced to make the dubious claim that we maintain these other values simply as a means to desirable mental states. Valuing more than our mental states (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  42.  30
    Helen A'Loy and other tales of female automata: a gendered reading of the narratives of hopes and fears of intelligent machines and artificial intelligence.Rachel Adams - 2020 - AI and Society 35 (3):569-579.
    The imaginative context in which artificial intelligence is embedded remains a crucial touchstone from which to understand and critique both the histories and prospective futures of an AI-driven world. A recent article from Cave and Dihal sets out a narrative schema of four hopes and four corresponding fears associated with intelligent machines and AI. This article seeks to respond to the work of Cave and Dihal by presenting a gendered reading of this schema of hopes and fears. I offer (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43.  34
    The Machine of State in Germany.Ere Pertti Nokkala - 2009 - Contributions to the History of Concepts 5 (1):71-93.
  44.  18
    Machine Learning Based Classification of Resting-State fMRI Features Exemplified by Metabolic State.Arkan Al-Zubaidi, Alfred Mertins, Marcus Heldmann, Kamila Jauch-Chara & Thomas F. Münte - 2019 - Frontiers in Human Neuroscience 13.
  45. On implementing a computation.David J. Chalmers - 1994 - Minds and Machines 4 (4):391-402.
    To clarify the notion of computation and its role in cognitive science, we need an account of implementation, the nexus between abstract computations and physical systems. I provide such an account, based on the idea that a physical system implements a computation if the causal structure of the system mirrors the formal structure of the computation. The account is developed for the class of combinatorial-state automata, but is sufficiently general to cover all other discrete computational formalisms. The implementation (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   58 citations  
  46.  34
    Clocks, Automata and the Mechanization of Nature (1300–1600).Sylvain Roudaut - 2022 - Philosophies 7 (6):139.
    This paper aims at tracking down, by looking at late medieval and early modern discussions over the ontological status of artifacts, the main steps of the process through which nature became theorized on a mechanistic model in the early 17th century. The adopted methodology consists in examining how inventions such as mechanical clocks and automata forced philosophers to modify traditional criteria based on an intrinsic principle of motion and rest for defining natural beings. The paper studies different strategies designed (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  24
    Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook. Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: - Michelle Waitzman. Stephen Cook: Complexity’s Humble Hero, pp. 3–28. - Bruce M. Kapron and Stephen A. Cook, ACM Interview of Stephen A. Cook by Bruce M. Kapron, pp. 29–44. - Stephen A. Cook, Overview of Computational Complexity, pp. 47–70. - Christos H. Papadimitriou, Cook’s NP-Completeness Paper and the Dawn of the New Theory, pp. 73–82. - Jan Krajíček, The Cook–Reckhow Definition, pp. 83–94. - Sam Buss, Polynomially Verifiable Arithmetic, pp. 95–106. - Paul Beame and Pierre McKenzie, Towards a Complexity Theory of Parallel Computation, pp. 107–126. - Nicholas Pippenger, Computation with Limited Space, pp. 127–140. - Stephen A. Cook, The Complexity of Theorem-Proving Procedures, pp. 143–152. - Stephen A. Cook, _Characterizations of Pushdown Machines in Terms of Time-Bound. [REVIEW]Pavel Pudlák - 2023 - Bulletin of Symbolic Logic 29 (4):657-660.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48.  24
    Deterministic automata simulation, universality and minimality.Cristian Calude, Elena Calude & Bakhadyr Khoussainov - 1997 - Annals of Pure and Applied Logic 90 (1-3):263-276.
    Finite automata have been recently used as alternative, discrete models in theoretical physics, especially in problems related to the dichotomy between endophysical/intrinsic and exophysical/ extrinsic perception . These studies deal with Moore experiments; the main result states that it is impossible to determine the initial state of an automaton, and, consequently, a discrete model of Heisenberg uncertainty has been suggested. For this aim the classical theory of finite automata — which considers automata with initial states — (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  49.  76
    Automata for Epistemic Temporal Logic with Synchronous Communication.Swarup Mohalik & R. Ramanujam - 2010 - Journal of Logic, Language and Information 19 (4):451-484.
    We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is arrived at. We define a class of epistemic automata, in which agents’ local states are annotated with abstract knowledge assertions about others. These are finite state agents who communicate synchronously with each other and information exchange is ‘perfect’. We show that the class of recognizable languages (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  50.  11
    The Ghost in the Machine: Pension Risks and Regulatory Responses in the United States and the United Kingdom.Deborah Mabbett - 2012 - Politics and Society 40 (1):107-129.
    The United States has introduced automatic enrollment into retirement savings schemes, and the United Kingdom is in the throes of doing so. The financial crisis has reminded us that returns on these schemes can be poor, even negative. Behavioral economics shows that people can be “nudged” into schemes regardless, but it also implies that the liberal account of market legitimation through informed choice cannot be applied. This article examines how risks are assigned in schemes and how enrollees might seek recourse (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 981