Results for 'computational-level theory'

999 found
Order:
  1. Anticipatory Computing: from a High-Level Theory to Hybrid Computing Implementations.Mihai Nadin - 2010 - International Journal of Applied Research on Information Technology and Computing 1 (1):1-27.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Contextual Vocabulary Acquisition: A Computational Theory and Educational Curriculum.William J. Rapaport & Michael W. Kibby - 2002 - In Nagib Callaos, Ana Breda & Ma Yolanda Fernandez J. (eds.), Proceedings of the 6th World Multiconference on Systemics, Cybernetics and Informatics. International Institute of Informatics and Systemics.
    We discuss a research project that develops and applies algorithms for computational contextual vocabulary acquisition (CVA): learning the meaning of unknown words from context. We try to unify a disparate literature on the topic of CVA from psychology, first- and secondlanguage acquisition, and reading science, in order to help develop these algorithms: We use the knowledge gained from the computational CVA system to build an educational curriculum for enhancing students’ abilities to use CVA strategies in their reading of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  3. Computation and Multiple Realizability.Marcin Miłkowski - 2016 - In Vincent C. Müller (ed.), Fundamental Issues of Artificial Intelligence. Cham: Springer. pp. 29-41.
    Multiple realizability (MR) is traditionally conceived of as the feature of computational systems, and has been used to argue for irreducibility of higher-level theories. I will show that there are several ways a computational system may be seen to display MR. These ways correspond to (at least) five ways one can conceive of the function of the physical computational system. However, they do not match common intuitions about MR. I show that MR is deeply interest-related, and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  4. Cognitive Computation sans Representation.Paul Schweizer - 2017 - In Thomas Powers (ed.), Philosophy and Computing: Essays in epistemology, philosophy of mind, logic, and ethics,. Cham, Switzerland: Springer. pp. 65-84.
    The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  5. Computation in Physical Systems: A Normative Mapping Account.Paul Schweizer - 2019 - In Matteo Vincenzo D'Alfonso & Don Berkich (eds.), On the Cognitive, Ethical, and Scientific Dimensions of Artificial Intelligence. Springer Verlag. pp. 27-47.
    The relationship between abstract formal procedures and the activities of actual physical systems has proved to be surprisingly subtle and controversial, and there are a number of competing accounts of when a physical system can be properly said to implement a mathematical formalism and hence perform a computation. I defend an account wherein computational descriptions of physical systems are high-level normative interpretations motivated by our pragmatic concerns. Furthermore, the criteria of utility and success vary according to our diverse (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  6. A fresh look at research strategies in computational cognitive science: The case of enculturated mathematical problem solving.Regina E. Fabry & Markus Pantsar - 2019 - Synthese 198 (4):3221-3263.
    Marr’s seminal distinction between computational, algorithmic, and implementational levels of analysis has inspired research in cognitive science for more than 30 years. According to a widely-used paradigm, the modelling of cognitive processes should mainly operate on the computational level and be targeted at the idealised competence, rather than the actual performance of cognisers in a specific domain. In this paper, we explore how this paradigm can be adopted and revised to understand mathematical problem solving. The computational- (...) approach applies methods from computational complexity theory and focuses on optimal strategies for completing cognitive tasks. However, human cognitive capacities in mathematical problem solving are essentially characterised by processes that are computationally sub-optimal, because they initially add to the computational complexity of the solutions. Yet, these solutions can be optimal for human cognisers given the acquisition and enactment of mathematical practices. Here we present diagrams and the spatial manipulation of symbols as two examples of problem solving strategies that can be computationally sub-optimal but humanly optimal. These aspects need to be taken into account when analysing competence in mathematical problem solving. Empirically informed considerations on enculturation can help identify, explore, and model the cognitive processes involved in problem solving tasks. The enculturation account of mathematical problem solving strongly suggests that computational-level analyses need to be complemented by considerations on the algorithmic and implementational levels. The emerging research strategy can help develop algorithms that model what we call enculturated cognitive optimality in an empirically plausible and ecologically valid way. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  7. Computation on Information, Meaning and Representations. An Evolutionary Approach (World Scientific 2011).Christophe Menant - 2011 - In Dodig-Crnkovic, Gordana & Mark Burgin (eds.), Information and Computation. World Scientific. pp. 255-286.
    Understanding computation as “a process of the dynamic change of information” brings to look at the different types of computation and information. Computation of information does not exist alone by itself but is to be considered as part of a system that uses it for some given purpose. Information can be meaningless like a thunderstorm noise, it can be meaningful like an alert signal, or like the representation of a desired food. A thunderstorm noise participates to the generation of meaningful (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  8. Intractability and the use of heuristics in psychological explanations.Iris Rooij, Cory Wright & Todd Wareham - 2012 - Synthese 187 (2):471-487.
    Many cognitive scientists, having discovered that some computational-level characterization f of a cognitive capacity φ is intractable, invoke heuristics as algorithmic-level explanations of how cognizers compute f. We argue that such explanations are actually dysfunctional, and rebut five possible objections. We then propose computational-level theory revision as a principled and workable alternative.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  9. Discovering Empirical Theories of Modular Software Systems. An Algebraic Approach.Nicola Angius & Petros Stefaneas - 2016 - In Vincent C. Müller (ed.), Computing and philosophy: Selected papers from IACAP 2014. Cham: Springer. pp. 99-115.
    This paper is concerned with the construction of theories of software systems yielding adequate predictions of their target systems’ computations. It is first argued that mathematical theories of programs are not able to provide predictions that are consistent with observed executions. Empirical theories of software systems are here introduced semantically, in terms of a hierarchy of computational models that are supplied by formal methods and testing techniques in computer science. Both deductive top-down and inductive bottom-up approaches in the discovery (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10.  99
    Mixed computation: grammar up and down the Chomsky Hierarchy.Diego Gabriel Krivochen - 2021 - Evolutionary Linguistic Theory 2 (3):215-244.
    Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recur-sive enumeration is carried out by a procedure which strongly generates a set of structural de-scriptions Σ and weakly generates a set of strings S; a grammar is thus a function that pairs an element of Σ with elements of S. Structural descriptions are obtained by means of Context-Free phrase structure (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Semantic information and the correctness theory of truth.Luciano Floridi - 2011 - Erkenntnis 74 (2):147-175.
    Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  12. Ontological theory for ontological engineering: Biomedical systems information integration.James M. Fielding, Jonathan Simon, Werner Ceusters & Barry Smith - 2004 - In Fielding James M., Simon Jonathan, Ceusters Werner & Smith Barry (eds.), Proceedings of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning (KR2004), Whistler, BC, 2-5 June 2004. pp. 114–120.
    Software application ontologies have the potential to become the keystone in state-of-the-art information management techniques. It is expected that these ontologies will support the sort of reasoning power required to navigate large and complex terminologies correctly and efficiently. Yet, there is one problem in particular that continues to stand in our way. As these terminological structures increase in size and complexity, and the drive to integrate them inevitably swells, it is clear that the level of consistency required for such (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  13. Embodied Cognition and the Grip of Computational Metaphors.Kate Finley - forthcoming - Ergo: An Open Access Journal of Philosophy.
    (Penultimate draft) Embodied Cognition holds that bodily (e.g. sensorimotor) states and processes are directly involved in some higher-level cognitive functions (e.g. reasoning). This challenges traditional views of cognition according to which bodily states and processes are, at most, indirectly involved in higher-level cognition. Although some elements of Embodied Cognition have been integrated into mainstream cognitive science, others still face adamant resistance. In this paper, rather than straightforwardly defend Embodied Cognition against specific objections I will do the following. First, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  14. Quantum Theories of Consciousness.Paavo Pylkkänen - 2018 - In Rocco J. Gennaro (ed.), The Routledge Handbook of Consciousness. New York, NY, USA: pp. 216-231.
    This paper provides a brief introduction to quantum theory and the proceeds to discuss the different ways in which the relationship between quantum theory and mind/consciousness is seen in some of the main alternative interpretations of quantum theory namely by Bohr; von Neumann; Penrose: Everett; and Bohm and Hiley. It briefly considers how qualia might be explained in a quantum framework, and makes a connection to research on quantum biology, quantum cognition and quantum computation. The paper notes (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. Outline of a theory of truth as correctness for semantic information.Luciano Floridi - 2009 - tripleC 7 (2):142-157.
    The article develops a correctness theory of truth (CTT) for semantic information. After the introduction, in section two, semantic information is shown to be translatable into propositional semantic information (i). In section three, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in section four, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  16.  7
    Implications of computer science theory for the simulation hypothesis.David Wolpert - manuscript
    The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns {computers} that simulate physical universes, which means that to properly investigate it we need to couple computer science theory with physics. Here I do this by exploiting the physical Church-Turing thesis. This allows me to introduce a preliminary investigation of some of the computer science theoretic aspects of the simulation hypothesis. In particular, building on Kleene's second recursion theorem, I (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17. Neutrosophic Crisp Set Theory.A. A. Salama & Florentin Smarandache - 2015 - Columbus, OH, USA: Educational Publishers.
    In this book the authors introduce and study the following notions: Neutrosophic Crisp Points, Neutrosophic Crisp Relations, Neutrosophic Crisp Sets, Neutrosophic Set Generated by (Characteristic Function), alpha-cut Level for Neutrosophic Sets, Neutrosophic Crisp Continuous Function, Neutrosophic Crisp Compact Spaces, Neutrosophic Crisp Nearly Open Sets, Neutrosophic Crisp Ideals, Neutrosophic Crisp Filter, Neutrosophic Crisp Local Functions, Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals, Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity, Neutrosophic Topological Region, Neutrosophic Closed Set and Neutrosophic Continuous Function, etc. They (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  18. Level theory, part 1: Axiomatizing the bare idea of a cumulative hierarchy of sets.Tim Button - 2021 - Bulletin of Symbolic Logic 27 (4):436-460.
    The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets found before S, we find a set whose members are exactly those sets. We find nothing else at S.' Surprisingly, this story already guarantees that the sets are arranged in well-ordered levels, and suffices for quasi-categoricity. I show this by presenting Level Theory, a simplification of (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  19. Records Management Theory's Dilemma: What is a Record?Joshua Finnell - 2011 - Library Philosophy and Practice 2011:567.
    A familiar dialogue is taking place in the professional literature of records and information management. Since the early 1990s, the theoretical foundation of a records management theory has been constructed on convergence (Pemberton & Nugent, 1995; Walters, 1995; Zawiyah M Yusof & Robert W Chell, 2002). While certain concepts are shared across disciplines, arguably the most foundational definition is the most divergent: a record. Each discipline (Archival Science, Library Science, Computer Science) defines the term record in its own way. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20.  85
    Implications of computer science theory for the simulation hypothesis.David Wolpert - manuscript
    Download  
     
    Export citation  
     
    Bookmark  
  21. Level theory, part 2: Axiomatizing the bare idea of a potential hierarchy.Tim Button - 2021 - Bulletin of Symbolic Logic 27 (4):461-484.
    Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. Level Theory, Part 3: A Boolean Algebra of Sets Arranged in Well-Ordered Levels.Tim Button - 2022 - Bulletin of Symbolic Logic 28 (1):1-26.
    On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. Semantic information and the correctness theory of truth.Luciano Floridi - 2011 - Erkenntnis 74 (2):147–175.
    Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  24. Computational situation theory.Erkan Tin & Varol Akman - 1994 - ACM SIGART Bulletin 5 (4):4-17.
    Situation theory has been developed over the last decade and various versions of the theory have been applied to a number of linguistic issues. However, not much work has been done in regard to its computational aspects. In this paper, we review the existing approaches towards 'computational situation theory' with considerable emphasis on our own research.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  25. W poszukiwaniu ontologicznych podstaw prawa. Arthura Kaufmanna teoria sprawiedliwości [In Search for Ontological Foundations of Law: Arthur Kaufmann’s Theory of Justice].Marek Piechowiak - 1992 - Instytut Nauk Prawnych PAN.
    Arthur Kaufmann is one of the most prominent figures among the contemporary philosophers of law in German speaking countries. For many years he was a director of the Institute of Philosophy of Law and Computer Sciences for Law at the University in Munich. Presently, he is a retired professor of this university. Rare in the contemporary legal thought, Arthur Kaufmann's philosophy of law is one with the highest ambitions — it aspires to pinpoint the ultimate foundations of law by explicitly (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  26. Chains of Inferences and the New Paradigm in the Psychology of Reasoning.Ulf Hlobil - 2016 - Review of Philosophy and Psychology 7 (1):1-16.
    The new paradigm in the psychology of reasoning draws on Bayesian formal frameworks, and some advocates of the new paradigm think of these formal frameworks as providing a computational-level theory of rational human inference. I argue that Bayesian theories should not be seen as providing a computational-level theory of rational human inference, where by “Bayesian theories” I mean theories that claim that all rational credal states are probabilistically coherent and that rational adjustments of degrees (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  27. Information, Computation, Cognition. Agency-Based Hierarchies of Levels.Gordana Dodig-Crnkovic - 2016 - In Vincent C. Müller (ed.), Fundamental Issues of Artificial Intelligence. Cham: Springer. pp. 139-159.
    This paper connects information with computation and cognition via concept of agents that appear at variety of levels of organization of physical/chemical/cognitive systems – from elementary particles to atoms, molecules, life-like chemical systems, to cognitive systems starting with living cells, up to organisms and ecologies. In order to obtain this generalized framework, concepts of information, computation and cognition are generalized. In this framework, nature can be seen as informational structure with computational dynamics, where an (info-computational) agent is needed (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  28. Agent-Based Computational Economics: A Constructive Approach to Economic Theory.Leigh Tesfatsion - 2006 - In Leigh Tesfatsion & Kenneth L. Judd (eds.), Handbook of Computational Economics, Volume 2: Agent-Based Computational Economics. Amsterdam, The Netherlands: Elsevier.
    Economies are complicated systems encompassing micro behaviors, interaction patterns, and global regularities. Whether partial or general in scope, studies of economic systems must consider how to handle difficult real-world aspects such as asymmetric information, imperfect competition, strategic interaction, collective learning, and the possibility of multiple equilibria. Recent advances in analytical and computational tools are permitting new approaches to the quantitative study of these aspects. One such approach is Agent-based Computational Economics (ACE), the computational study of economic processes (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  29. Inter-level relations in computer science, biology, and psychology.Fred Boogerd, Frank Bruggeman, Catholijn Jonker, Huib Looren de Jong, Allard Tamminga, Jan Treur, Hans Westerhoff & Wouter Wijngaards - 2002 - Philosophical Psychology 15 (4):463–471.
    Investigations into inter-level relations in computer science, biology and psychology call for an *empirical* turn in the philosophy of mind. Rather than concentrate on *a priori* discussions of inter-level relations between 'completed' sciences, a case is made for the actual study of the way inter-level relations grow out of the developing sciences. Thus, philosophical inquiries will be made more relevant to the sciences, and, more importantly, philosophical accounts of inter-level relations will be testable by confronting them (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  30. Manufacturing Morality A general theory of moral agency grounding computational implementations: the ACTWith model.Jeffrey White - 2013 - In Computational Intelligence. Nova Publications. pp. 1-65.
    The ultimate goal of research into computational intelligence is the construction of a fully embodied and fully autonomous artificial agent. This ultimate artificial agent must not only be able to act, but it must be able to act morally. In order to realize this goal, a number of challenges must be met, and a number of questions must be answered, the upshot being that, in doing so, the form of agency to which we must aim in developing artificial agents (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Computation and Functionalism: Syntactic Theory of Mind Revisited.Murat Aydede - 2005 - In Gurol Irzik & Guven Guzeldere (eds.), Boston Studies in the History and Philosophy of Science. Springer.
    I argue that Stich's Syntactic Theory of Mind (STM) and a naturalistic narrow content functionalism run on a Language of Though story have the same exact structure. I elaborate on the argument that narrow content functionalism is either irremediably holistic in a rather destructive sense, or else doesn't have the resources for individuating contents interpersonally. So I show that, contrary to his own advertisement, Stich's STM has exactly the same problems (like holism, vagueness, observer-relativity, etc.) that he claims plague (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  32. Multi-level computational methods for interdisciplinary research in the HathiTrust Digital Library.Jaimie Murdock, Colin Allen, Katy Börner, Robert Light, Simon McAlister, Andrew Ravenscroft, Robert Rose, Doori Rose, Jun Otsuka, David Bourget, John Lawrence & Chris Reed - 2017 - PLoS ONE 12 (9).
    We show how faceted search using a combination of traditional classification systems and mixed-membership topic models can go beyond keyword search to inform resource discovery, hypothesis formulation, and argument extraction for interdisciplinary research. Our test domain is the history and philosophy of scientific work on animal mind and cognition. The methods can be generalized to other research areas and ultimately support a system for semi-automatic identification of argument structures. We provide a case study for the application of the methods to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  33. Computational Theories of Conscious Experience: Between a Rock and a Hard Place.Gary Bartlett - 2012 - Erkenntnis 76 (2):195-209.
    Very plausibly, nothing can be a genuine computing system unless it meets an input-sensitivity requirement. Otherwise all sorts of objects, such as rocks or pails of water, can count as performing computations, even such as might suffice for mentality—thus threatening computationalism about the mind with panpsychism. Maudlin in J Philos 86:407–432, ( 1989 ) and Bishop ( 2002a , b ) have argued, however, that such a requirement creates difficulties for computationalism about conscious experience, putting it in conflict with the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  34. Computing with causal theories.Erkan Tin & Varol Akman - 1992 - International Journal of Pattern Recognition and Artificial Intelligence 6 (4):699-730.
    Formalizing commonsense knowledge for reasoning about time has long been a central issue in AI. It has been recognized that the existing formalisms do not provide satisfactory solutions to some fundamental problems, viz. the frame problem. Moreover, it has turned out that the inferences drawn do not always coincide with those one had intended when one wrote the axioms. These issues call for a well-defined formalism and useful computational utilities for reasoning about time and change. Yoav Shoham of Stanford (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. A Computational Theory of Perspective and Reference in Narrative.Janyce M. Wiebe & William J. Rapaport - 1988 - In Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics. pp. 131-138.
    Narrative passages told from a character's perspective convey the character's thoughts and perceptions. We present a discourse process that recognizes characters'.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  36. The Rapid Recovery of Three-Dimensional Structure from Line Drawings.Ronald A. Rensink - 1992 - Dissertation, University of British Columbia
    A computational theory is developed that explains how line drawings of polyhedral objects can be interpreted rapidly and in parallel at early levels of human vision. The key idea is that a time-limited process can correctly recover much of the three-dimensional structure of these objects when split into concurrent streams, each concerned with a single aspect of scene structure.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  37.  81
    Theory of Fuzzy Time Computation (TC* vs TC & TQC).Didehvar Farzad - manuscript
    One of the possible hypotheses about time is to consider any instant of time as a fuzzy number so that two instances of time could be overlapped. Historically, some Mathematicians and Philosophers have had similar ideas. Brouwer and Husserl are two examples. This article studies the impact of this change on the Theory of Computation and Complexity Theory. In order to rebuild the Theory of Computation in a more successful and productive approach to solve some major problems (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38. Supervenience and computational explanation in vision theory.Peter Morton - 1993 - Philosophy of Science 60 (1):86-99.
    According to Marr's theory of vision, computational processes of early vision rely for their success on certain "natural constraints" in the physical environment. I examine the implications of this feature of Marr's theory for the question whether psychological states supervene on neural states. It is reasonable to hold that Marr's theory is nonindividualistic in that, given the role of natural constraints, distinct computational theories of the same neural processes may be justified in different environments. But (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  39. Community-level evolutionary processes: Linking community genetics with replicator-interactor theory.Christopher Lean, W. Ford Doolittle & Joseph Bielawski - 2022 - Proceedings of the National Academy of Sciences 119 (46):e2202538119.
    Understanding community-level selection using Lewontin’s criteria requires both community-level inheritance and community-level heritability, and in the discipline of community and ecosystem genetics, these are often conflated. While there are existing studies that show the possibility of both, these studies impose community-level inheritance as a product of the experimental design. For this reason, these experiments provide only weak support for the existence of community-level selection in nature. By contrast, treating communities as interactors (in line with Hull’s (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. Towards a computational theory of mood.Laura Sizer - 2000 - British Journal for the Philosophy of Science 51 (4):743-770.
    Moods have global and profound effects on our thoughts, motivations and behavior. To understand human behavior and cognition fully, we must understand moods. In this paper I critically examine and reject the methodology of conventional ?cognitive theories? of affect. I lay the foundations of a new theory of moods that identifies them with processes of our cognitive functional architecture. Moods differ fundamentally from some of our other affective states and hence require distinct explanatory tools. The computational theory (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  41. The Theory of Computability Developed in Terms of Satisfaction.James Cain - 1999 - Notre Dame Journal of Formal Logic 40 (4):515-532.
    The notion of computability is developed through the study of the behavior of a set of languages interpreted over the natural numbers which contain their own fully defined satisfaction predicate and whose only other vocabulary is limited to "0", individual variables, the successor function, the identity relation and operators for disjunction, conjunction, and existential quantification.
    Download  
     
    Export citation  
     
    Bookmark  
  42. Kurt Gödel and Computability Theory.Richard Zach - 2006 - In Arnold Beckmann, Ulrich Berger, Benedikt Löwe & John V. Tucker (eds.), Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings. Berlin: Springer. pp. 575--583.
    Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  43. Mechanizmy predykcyjne i ich normatywność [Predictive mechanisms and their normativity].Michał Piekarski - 2020 - Warszawa, Polska: Liberi Libri.
    The aim of this study is to justify the belief that there are biological normative mechanisms that fulfill non-trivial causal roles in the explanations (as formulated by researchers) of actions and behaviors present in specific systems. One example of such mechanisms is the predictive mechanisms described and explained by predictive processing (hereinafter PP), which (1) guide actions and (2) shape causal transitions between states that have specific content and fulfillment conditions (e.g. mental states). Therefore, I am guided by a specific (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44. Commentary on Zeki Inner Vision. [REVIEW]Jennifer A. McMahon - 2000 - Leonardo Reviews On-Line:N/A.
    The late vision theorist David Marr identified three levels of explanation that he argued needed to be addressed in order to understand vision : (i) the psychological, functional or computational level of processes; (ii) the physical or neurological which is the level of explanation employed by Zeki; and (iii) the algorithmic – the level of implementation. For Zeki’s purpose of drawing upon vision-theory in order to better understand art and aesthetics, there is no need to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Computational Transformation of the Public Sphere: Theories and Cases.S. M. Amadae (ed.) - 2020 - Helsinki: Faculty of Social Sciences, University of Helsinki.
    This book is an edited collection of original research papers on the digital revolution of the public and governance. It covers cyber governance in Finland, and the securitization of cyber security in Finland. It investigates the cases of Brexit, the 2016 US presidential election of Donald Trump, the 2017 presidential election of Volodymyr Zelensky, and Brexit. It examines the environmental concerns of climate change and greenwashing, and the impact of digital communication giving rise to the #MeToo and Incel movements. It (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. A computational framework for implementing Baars' global worslaoce theory of consciousness.Ivan Moura & Pierre Bonzon - 2004 - In Proceedings Conference of Brain Inspired Cognitive Systems (BICS),.
    We consider Baars’ "Global Workspace" theory of consciousness and discuss its possible representation within a model of intelligent agents. We first review a particular agent implementation that is given by an abstract machine, and then identify the extensions that are required in order to accommodate the main aspects of consciousness. According to Baars’ theory, this amounts to unconscious process coalitions that result in the creation of contexts. These extensions can be formulated within a reified virtual machine encompassing a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47.  66
    Theory of Fuzzy Time Computation (2) (TC+CON(〖TC*〗)ͰP≠NP).Didehvar Farzad - manuscript
    Throughout this paper, we prove TC+CON(〖TC*〗 )ͰP≠NP. To do that, firstly, we introduce the definition of scope*. This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face a finite number of efficiently computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach a world of computation in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48.  65
    Theory of Fuzzy Time Computation (2, P vs NP problem).Didehvar Farzad - manuscript
    Throughout this paper, we prove TC + CON(TC*)ͰP ≠ NP. To do that, firstly we introduce the definition of scope∗ . This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face finite number of efficient computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49.  60
    Theory of Fuzzy Time Computation (2) (TC+CON(〖TC*〗)ͰP≠NP).Didehvar Farzad - manuscript
    Throughout this paper, we prove TC+CON(〖TC* 〗)ͰP≠NP. To do that, firstly, we introduce the definition of scope_^*. This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face a finite number of efficiently computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach a world of computation in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50.  58
    Theory of Fuzzy Time Computation (2) (TC+CON(〖TC〗^*)ͰP≠NP).Didehvar Farzad - manuscript
    Throughout this paper, we prove TC+CON(〖TC〗^* )ͰP≠NP. To do that, firstly, we introduce the definition of scope_^*. This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face a finite number of efficiently computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a world of computation, (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 999