Search results for 'Automata' (try it on Scholar)

348 found
Sort by:
  1. David Joslin (2006). Real Realization: Dennett's Real Patterns Versus Putnam's Ubiquitous Automata. [REVIEW] Minds and Machines 16 (1):29-41.score: 24.0
    Both Putnam and Searle have argued that that every abstract automaton is realized by every physical system, a claim that leads to a reductio argument against Cognitivism or Strong AI: if it is possible for a computer to be conscious by virtue of realizing some abstract automaton, then by Putnam’s theorem every physical system also realizes that automaton, and so every physical system is conscious—a conclusion few supporters of Strong AI would be willing to accept. Dennett has suggested a criterion (...)
    Direct download (15 more)  
     
    My bibliography  
     
    Export citation  
  2. Swarup Mohalik & R. Ramanujam (2010). Automata for Epistemic Temporal Logic with Synchronous Communication. Journal of Logic, Language and Information 19 (4):451-484.score: 24.0
    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 has (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Raymond J. Nelson (1975). Behaviorism, Finite Automata, and Stimulus-Response Theory. Theory and Decision 6 (August):249-67.score: 24.0
    In this paper it is argued that certain stimulus-response learning models which are adequate to represent finite automata (acceptors) are not adequate to represent noninitial state input-output automata (transducers). This circumstance suggests the question whether or not the behavior of animals if satisfactorily modelled by automata is predictive. It is argued in partial answer that there are automata which can be explained in the sense that their transition and output functions can be described (roughly, Hempel-type covering (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. Francisco José Soler Gil & Manuel Alfonseca (2013). Fine Tuning Explained? Multiverses and Cellular Automata. Journal for General Philosophy of Science 44 (1):153-172.score: 24.0
    The objective of this paper is analyzing to which extent the multiverse hypothesis provides a real explanation of the peculiarities of the laws and constants in our universe. First we argue in favor of the thesis that all multiverses except Tegmark’s “mathematical multiverse” are too small to explain the fine tuning, so that they merely shift the problem up one level. But the “mathematical multiverse" is surely too large. To prove this assessment, we have performed a number of experiments with (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Shane Steinert-Threlkeld & I. I. I. Thomas F. Icard (2013). Iterating Semantic Automata. Linguistics and Philosophy 36 (2):151-173.score: 24.0
    The semantic automata framework, developed originally in the 1980s, provides computational interpretations of generalized quantifiers. While recent experimental results have associated structural features of these automata with neuroanatomical demands in processing sentences with quantifiers, the theoretical framework has remained largely unexplored. In this paper, after presenting some classic results on semantic automata in a modern style, we present the first application of semantic automata to polyadic quantification, exhibiting automata for iterated quantifiers. We also discuss the (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Dennis P. Waters (2012). Von Neumann's Theory of Self-Reproducing Automata: A Useful Framework for Biosemiotics? Biosemiotics 5 (1):5-15.score: 24.0
    As interpreted by Pattee, von Neumann’s Theory of Self-Reproducing Automata has proved to be a useful tool for understanding some of the difficulties and paradoxes of molecular biosemiotics. But is its utility limited to molecular systems or is it more generally applicable within biosemiotics? One way of answering that question is to look at the Theory as a model for one particular high-level biosemiotic activity, human language. If the model is not useful for language, then it certainly cannot be (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Edward P. Stabler (1987). Kripke on Functionalism and Automata. Synthese 70 (January):1-22.score: 21.0
    Saul Kripke has proposed an argument to show that there is a serious problem with many computational accounts of physical systems and with functionalist theories in the philosophy of mind. The problem with computational accounts is roughly that they provide no noncircular way to maintain that any particular function with an infinite domain is realized by any physical system, and functionalism has the similar problem because of the character of the functional systems that are supposed to be realized by organisms. (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  8. Richard W. Lind (1986). The Priority of Attention: Intentionality for Automata. The Monist 69 (October):609-619.score: 21.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  9. Ramón Alonso-Sanz (forthcoming). Reversible Cellular Automata with Memory of Delay Type. Complexity:n/a-n/a.score: 21.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  10. Stefano Cavagnetto (2009). Some Applications of Propositional Logic to Cellular Automata. Mathematical Logic Quarterly 55 (6):605-616.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Genaro J. Martínez, Andrew Adamatzky, Juan C. Seck‐Tuoh‐Mora & Ramon Alonso‐Sanz (2010). How to Make Dull Cellular Automata Complex by Adding Memory: Rule 126 Case Study. Complexity 15 (6):34-49.score: 21.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. Clifford A. Reiter (2002). Fuzzy Automata and Life. Complexity 7 (3):19-29.score: 21.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Jürgen Klüver & Jörn Schmidt (1999). Control Parameters in Boolean Networks and Cellular Automata Revisited From a Logical and a Sociological Point of View. Complexity 5 (1):45-52.score: 21.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  14. Eduardo Mizraji (2004). The Emergence of Dynamical Complexity: An Exploration Using Elementary Cellular Automata. Complexity 9 (6):33-42.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Eleonora Bilotta & Pietro Pantano (2006). Structural and Functional Growth in Self‐Reproducing Cellular Automata. Complexity 11 (6):12-29.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  16. Richard R. Brooks, Christopher Griffin & T. Alan Payne (2004). A Cellular Automata Model Can Quickly Approximate UDP and TCP Network Traffic. Complexity 9 (3):32-40.score: 21.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  17. Gina Maira Barbosa de Oliveira, Pedro P. B. de Oliveira & Nizam Omar (2000). Guidelines for Dynamics‐Based Parameterization of One‐Dimensional Cellular Automata Rule Spaces. Complexity 6 (2):63-71.score: 21.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  18. Christopher J. Hazard, Kyle R. Kimport & David H. Johnson (2005). Emergent Behavior in Two Complex Cellular Automata Rule Sets. Complexity 10 (5):45-55.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. James T. Culbertson (1963). The Minds Of Robots: Sense Data, Memory Images, And Behavior In Conscious Automata. Urbana: University Of Illinois Press.score: 21.0
  20. Ioannis D. Katerelos & Andreas G. Koulouris (2004). Is Prediction Possible? Chaotic Behavior of Multiple Equilibria Regulation Model in Cellular Automata Topology. Complexity 10 (1):23-36.score: 21.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  21. Chris Salzberg & Hiroki Sayama (2004). Complex Genetic Evolution of Artificial Self-Replicators in Cellular Automata. Complexity 10 (2):33-39.score: 21.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  22. Ioan Sturzu & Mahfuza Khatun (2005). Quantum Calculation of Thermal Effect in Quantum‐Dot Cellular Automata. Complexity 10 (4):73-78.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  23. Andrew Wuensche (1999). Classifying Cellular Automata Automatically: Finding Gliders, Filtering, and Relating Space-Time Patterns, Attractor Basins, and theZ Parameter. Complexity 4 (3):47-66.score: 21.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Anouk Barberousse, Sara Franceschelli & Cyrille Imbert, Cellular Automata, Modeling, and Computation.score: 18.0
    Cellular Automata (CA) based simulations are widely used in a great variety of domains, fromstatistical physics to social science. They allow for spectacular displays and numerical predictions. Are they forall that a revolutionary modeling tool, allowing for “direct simulation”, or for the simulation of “the phenomenon itself”? Or are they merely models "of a phenomenological nature rather than of a fundamental one”? How do they compareto other modeling techniques? In order to answer these questions, we present a systematic exploration (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  25. Francesco Berto & Jacopo Tagliabue (2012). Cellular Automata. Stanford Encyclopedia of Philosophy.score: 18.0
    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  
     
    My bibliography  
     
    Export citation  
  26. Pete Mandik (2008). Cognitive Cellular Automata. In Complex Biological Systems:. Icfai University Press.score: 18.0
    In this paper I explore the question of how artificial life might be used to get a handle on philosophical issues concerning the mind-body problem. I focus on questions concerning what the physical precursors were to the earliest evolved versions of intelligent life. I discuss how cellular automata might constitute an experimental platform for the exploration of such issues, since cellular automata offer a unified framework for the modeling of physical, biological, and psychological processes. I discuss what it (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  27. Stanley Gudder (2000). Basic Properties of Quantum Automata. Foundations of Physics 30 (2):301-319.score: 18.0
    This paper develops a theory of quantum automata and their slightly more general versions, q-automata. Quantum languages and η-quantum languages, 0≤η<1, are studied. Functions that can be realized as probability maps for q-automata are characterized. Quantum grammars are discussed and it is shown that quantum languages are precisely those languages that are induced by a quantum grammar. A quantum pumping lemma is employed to show that there are regular languages that are not η-quantum, 0≤η<1.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  28. T. Acton, S. Caffrey, S. Dunn, P. Vinson & K. Svozil (1998). Analogues of Quantum Complementarity in the Theory of Automata - a Prolegomenon to the Philosophy of Quantum Mechanics. Studies in History and Philosophy of Science Part B 29 (1):61-80.score: 18.0
    Complementarity is not only a feature of quantum mechanical systems but occurs also in the context of finite automata.
    Direct download  
     
    My bibliography  
     
    Export citation  
  29. Arto Salomaa (1985). Computation and Automata. Cambridge University Press.score: 18.0
    This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
    Direct download  
     
    My bibliography  
     
    Export citation  
  30. B. J. MacLennan, Continuous Spatial Automata.score: 18.0
    A continuous spatial automaton is analogous to a cellular automaton, except that the cells form a continuum, as do the possible states of the cells. After an informal mathematical description of spatial automata, we describe in detail a continuous analog of Conway’s “Life,” and show how the automaton can be implemented using the basic operations of field computation.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  31. J.-P. Moulin (1992). Modifiable Automata Self-Modifying Automata. Acta Biotheoretica 40 (2-3).score: 18.0
    One of the most important features of living beings that seems universal is perhaps their ability to be modified in a functional way.In order to modelize this characteristic, we designed automata with a finite number of instantaneous internal descriptions, with input(s) and output(s) and which are able to be functionally modified.
    Direct download  
     
    My bibliography  
     
    Export citation  
  32. Sasha Rubin (2008). Automata Presenting Structures: A Survey of the Finite String Case. Bulletin of Symbolic Logic 14 (2):169-209.score: 18.0
    A structure has a (finite-string) automatic presentation if the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  33. Claude Lobry & Hervé Elmoznino (2000). Combinatorial Properties of Some Cellular Automata Related to the Mosaic Cycle Concept. Acta Biotheoretica 48 (3-4).score: 18.0
    A cellular automaton that is related to the "mosaic cycle concept" is considered. We explain why such automata sustain very often, but not always, n-periodic trajectories (n being the number of states of the automaton). Our work is a first step in the direction of a theory of these type of automata which might be useful in modeling mosaic successions.
    Direct download  
     
    My bibliography  
     
    Export citation  
  34. Mirosław Kutyłowski (1988). Finite Automata, Real Time Processes and Counting Problems in Bounded Arithmetics. Journal of Symbolic Logic 53 (1):243-258.score: 18.0
    In this paper we present a negative solution of counting problems for some classes slightly different from bounded arithmetic (▵ 0 sets). To get the results we study properties of chains of finite automata.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  35. J.-P. Moulin (1999). Very Simple Models, the Self-Modifying Automata and Chain of Self-Modifying Automata, Can Explain Self-Referential Properties of Living Beings. Acta Biotheoretica 47 (3-4).score: 18.0
    Very often, living beings seem able to change their functioning when external conditions vary. In order to study this property, we have devised abstract machines whose internal organisation changes whenever the external conditions vary. The internal organisations of these machines (or programs), are as simple as possible, functions of discrete variables. We call such machines self-modifying automata.These machines stabilise after any transient steps when they go indefinitely through a loop (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  36. Itay Neeman (2008). Finite State Automata and Monadic Definability of Singular Cardinals. Journal of Symbolic Logic 73 (2):412 - 438.score: 18.0
    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 (3 more)  
     
    My bibliography  
     
    Export citation  
  37. Andrew Pickering (2014). Islands of Stability: Engaging Emergence from Cellular Automata to the Occupy Movement. Zeitschrift für Medien- Und Kulturforschung 2014 (1):121-134.score: 18.0
    Instead of considering »being with« in terms of non-problematic, machine-like places, where reliable entities assemble in stable relationships, STS conjures up a world where the achievement of chancy stabilisations and synchronisations is local. We have to analyse how and where a certain regularity and predictability in the intersection of scientists and their instruments, say, or of human individuals and groups, is produced. The paper reviews models of emergence drawn from the history of cybernetics—the canonical »black box,« homeostats, and cellular (...)—to enrich our imagination of the stabilisation process, and discusses the concept of »variety« as a way of clarifying its difficulty, with the antiuniversities of the 1960s and the Occupy movement as examples. Failures of »being with« are expectable. In conclusion, the paper reviews approaches to collective decision-making that reduce variety without imposing a neoliberal hierarchy. (shrink)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  38. T. Huxley (1874). On the Hypothesis That Animals Are Automata, and its History. Fortnightly Review 95:555-80.score: 15.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  39. William James (1879). Are We Automata? Mind 4 (13):1-22.score: 15.0
  40. Fred Ablondi (1998). Automata, Living and Non-Living: Descartes' Mechanical Biology and His Criteria for Life. [REVIEW] Biology and Philosophy 13 (2):179-186.score: 15.0
    Despite holding to the essential distinction between mind and body, Descartes did not adopt a life-body dualism. Though humans are the only creatures which can reason, as they are the only creatures whose body is in an intimate union with a soul, they are not the only finite beings who are alive. In the present note, I attempt to determine Descartes'' criteria for something to be ''living.'' Though certain passages associate such a principle with the presence of a properly functioning (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. Giovanni Sartor (2009). Cognitive Automata and the Law: Electronic Contracting and the Intentionality of Software Agents. [REVIEW] Artificial Intelligence and Law 17 (4):253-290.score: 15.0
    I shall argue that software agents can be attributed cognitive states, since their behaviour can be best understood by adopting the intentional stance. These cognitive states are legally relevant when agents are delegated by their users to engage, without users’ review, in choices based on their the agents’ own knowledge. Consequently, both with regard to torts and to contracts, legal rules designed for humans can also be applied to software agents, even though the latter do not have rights and duties (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  42. K. Svozil (1998). Analogues of Quantum Complementarity in the Theory of Automata. Studies in History and Philosophy of Science Part B 29 (1):61-80.score: 15.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  43. Guido Giglioni (1995). Automata Compared Boyle, Leibniz and the Debate on the Notion of Life and M. British Journal for the History of Philosophy 3 (2):249 – 278.score: 15.0
  44. Andreas Matthias (2004). The Responsibility Gap: Ascribing Responsibility for the Actions of Learning Automata. [REVIEW] Ethics and Information Technology 6 (3):175-183.score: 15.0
    Traditionally, the manufacturer/operator of a machine is held (morally and legally) responsible for the consequences of its operation. Autonomous, learning machines, based on neural networks, genetic algorithms and agent architectures, create a new situation, where the manufacturer/operator of the machine is in principle not capable of predicting the future machine behaviour any more, and thus cannot be held morally responsible or liable for it. The society must decide between not using this kind of machine any more (which is not a (...)
    Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  45. S. Berryman (2003). Ancient Automata and Mechanical Explanation. Phronesis 48 (4):344 - 369.score: 15.0
  46. Paola Cavalieri & Harlan B. Miller (1999). Automata, Receptacles, and Selves. Psyche 5 (24).score: 15.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  47. Adelheid Voskuhl (2007). Producing Objects, Producing Texts: Accounts of Android Automata in Late Eighteenth-Century Europe. Studies in History and Philosophy of Science Part A 38 (2):422-444.score: 15.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. Arthur W. Burks, Von Neumann's Self-Reproducing Automata : Technical Report.score: 15.0
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  49. Anouk Barberousse & Cyrille Imbert (forthcoming). Cellular Automata in Fluid Dynamics: Not so Different. Studies in History and Philosophy of Modern Physics.score: 15.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  50. Arthur W. Burks, Computation, Behavior, and Structure in Fixed and Growing Automata : Technical Report.score: 15.0
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 348