Results for 'Theory of Computational Complexity'

999 found
Order:
  1. Computational complexity in the philosophy of mind: unconventional methods to solve the problem of logical omniscience.Safal Aryal - manuscript
    The philosophy of mind is traditionally concerned with the study of mental processes, language, the representation of knowledge and the relation of the mind shares with the body; computational complexity theory is related to the classification of computationally solvable problems (be it via execution time, storage requirements, etc...). While there are well-established links between computer science in general & the philosophy of mind, many possible solutions to traditional problems in the philosophy of mind have not yet been (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. P≠NP, By accepting to make a shift in the Theory (Time as a fuzzy concept) The Structure of a Theory (TC*, Theory of Computation based on Fuzzy time).Farzad Didehvar - manuscript
    In a series of articles we try to show the need of a novel Theory for Theory of Computation based on considering time as a Fuzzy concept. Time is a central concept In Physics. First we were forced to consider some changes and modifications in the Theories of Physics. In the second step and throughout this article we show the positive Impact of this modification on Theory of Computation and Complexity Theory to rebuild it in (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  99
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. Strict Finitism's Unrequited Love for Computational Complexity.Noel Arteche - manuscript
    As a philosophy of mathematics, strict finitism has been traditionally concerned with the notion of feasibility, defended mostly by appealing to the physicality of mathematical practice. This has led the strict finitists to influence and be influenced by the field of computational complexity theory, under the widely held belief that this branch of mathematics is concerned with the study of what is “feasible in practice”. In this paper, I survey these ideas and contend that, contrary to popular (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics.Markus Pantsar - 2020 - Minds and Machines 31 (1):75-98.
    In computational complexity theory, decision problems are divided into complexity classes based on the amount of computational resources it takes for algorithms to solve them. In theoretical computer science, it is commonly accepted that only functions for solving problems in the complexity class P, solvable by a deterministic Turing machine in polynomial time, are considered to be tractable. In cognitive science and philosophy, this tractability result has been used to argue that only functions in (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  7. Free Energy and Virtual Reality in Psychoanalysis and Neuroscience: A Complexity Theory of Dreaming and Mental Disorder.Jim Hopkins - 2016 - Frontiers in Psychology 7.
    This paper compares the free energy neuroscience now advocated by Karl Friston and his colleagues with that hypothesised by Freud, arguing that Freud's notions of conflict and trauma can be understood in terms of computational complexity. It relates Hobson and Friston's work on dreaming and the reduction of complexity to contemporary accounts of dreaming and the consolidation of memory, and advances the hypothesis that mental disorder can be understood in terms of computational complexity and the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. Reflections on a theory of organisms: holism in biology.Walter M. Elsasser - 1987 - Baltimore, Md: Published for the Johns Hopkins Dept. of Earth and Planetary Sciences by the Johns Hopkins University Press.
    Are living organisms--as Descartes argued--just machines? Or is the nature of life such that it can never be fully explained by mechanistic models? In this thought-provoking and controversial book, eminent geophysicist Walter M. Elsasser argues that the behavior of living organisms cannot be reduced to physico-chemical causality. Suggesting that molecular biology today is at the same point as Newtonian physics on the eve of the quantum revolution, Elsasser lays the foundation for a theoretical biology that points the way toward a (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  9. Wolpert, Chaitin and Wittgenstein on impossibility, incompleteness, the liar paradox, theism, the limits of computation, a non-quantum mechanical uncertainty principle and the universe as computer—the ultimate theorem in Turing Machine Theory (revised 2019).Michael Starks - 2019 - In Suicidal Utopian Delusions in the 21st Century -- Philosophy, Human Nature and the Collapse of Civilization-- Articles and Reviews 2006-2019 4th Edition Michael Starks. Las Vegas, NV USA: Reality Press. pp. 294-299.
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv dot org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. Complexity and the Evolution of Consciousness.Walter Veit - 2023 - Biological Theory 18 (3):175-190.
    This article introduces and defends the “pathological complexity thesis” as a hypothesis about the evolutionary origins of minimal consciousness, or sentience, that connects the study of animal consciousness closely with work in behavioral ecology and evolutionary biology. I argue that consciousness is an adaptive solution to a design problem that led to the extinction of complex multicellular animal life following the Avalon explosion and that was subsequently solved during the Cambrian explosion. This is the economic trade-off problem of having (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  11. Artificial Evil and the Foundation of Computer Ethics.Luciano Floridi & J. W. Sanders - 2001 - Springer Netherlands. Edited by Luciano Floridi & J. W. Sanders.
    Moral reasoning traditionally distinguishes two types of evil:moral (ME) and natural (NE). The standard view is that ME is the product of human agency and so includes phenomena such as war,torture and psychological cruelty; that NE is the product of nonhuman agency, and so includes natural disasters such as earthquakes, floods, disease and famine; and finally, that more complex cases are appropriately analysed as a combination of ME and NE. Recently, as a result of developments in autonomous agents in cyberspace, (...)
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  12. Artificial evil and the foundation of computer ethics.L. Floridi & J. Sanders - 2000 - Etica E Politica 2 (2).
    Moral reasoning traditionally distinguishes two types of evil: moral and natural. The standard view is that ME is the product of human agency and so includes phenomena such as war, torture and psychological cruelty; that NE is the product of nonhuman agency, and so includes natural disasters such as earthquakes, floods, disease and famine; and finally, that more complex cases are appropriately analysed as a combination of ME and NE. Recently, as a result of developments in autonomous agents in cyberspace, (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  13. Philosophy and theory of artificial intelligence 2017.Vincent C. Müller (ed.) - 2017 - Berlin: Springer.
    This book reports on the results of the third edition of the premier conference in the field of philosophy of artificial intelligence, PT-AI 2017, held on November 4 - 5, 2017 at the University of Leeds, UK. It covers: advanced knowledge on key AI concepts, including complexity, computation, creativity, embodiment, representation and superintelligence; cutting-edge ethical issues, such as the AI impact on human dignity and society, responsibilities and rights of machines, as well as AI threats to humanity and AI (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  14. Wolpert, Chaitin and Wittgenstein on impossibility, incompleteness, the limits of computation, theism and the universe as computer-the ultimate Turing Theorem.Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization Michael Starks 3rd Ed. (2017).
    I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even (...)
    Download  
     
    Export citation  
     
    Bookmark  
  15. 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  
  16. 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  
  17. Languages, machines, and classical computation.Luis M. Augusto - 2021 - London, UK: College Publications.
    3rd ed, 2021. A circumscription of the classical theory of computation building up from the Chomsky hierarchy. With the usual topics in formal language and automata theory.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  18. Lightning in a Bottle: Complexity, Chaos, and Computation in Climate Science.Jon Lawhead - 2014 - Dissertation, Columbia University
    Climatology is a paradigmatic complex systems science. Understanding the global climate involves tackling problems in physics, chemistry, economics, and many other disciplines. I argue that complex systems like the global climate are characterized by certain dynamical features that explain how those systems change over time. A complex system's dynamics are shaped by the interaction of many different components operating at many different temporal and spatial scales. Examining the multidisciplinary and holistic methods of climatology can help us better understand the nature (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Towards a Theory of Computation similar to some other scientific theories.Antonino Drago - manuscript
    At first sight the Theory of Computation i) relies on a kind of mathematics based on the notion of potential infinity; ii) its theoretical organization is irreducible to an axiomatic one; rather it is organized in order to solve a problem: “What is a computation?”; iii) it makes essential use of doubly negated propositions of non-classical logic, in particular in the word expressions of the Church-Turing’s thesis; iv) its arguments include ad absurdum proofs. Under such aspects, it is like (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. 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-level approach (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  21. 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  
  22. 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  
  23. Adaptive Intelligent Tutoring System for learning Computer Theory.Mohammed A. Al-Nakhal & Samy S. Abu Naser - 2017 - European Academic Research 4 (10).
    In this paper, we present an intelligent tutoring system developed to help students in learning Computer Theory. The Intelligent tutoring system was built using ITSB authoring tool. The system helps students to learn finite automata, pushdown automata, Turing machines and examines the relationship between these automata and formal languages, deterministic and nondeterministic machines, regular expressions, context free grammars, undecidability, and complexity. During the process the intelligent tutoring system gives assistance and feedback of many types in an intelligent manner (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  24. Modeling inference of mental states: As simple as possible, as complex as necessary.Ben Meijering, Niels A. Taatgen, Hedderik van Rijn & Rineke Verbrugge - 2014 - Interaction Studies 15 (3):455-477.
    Behavior oftentimes allows for many possible interpretations in terms of mental states, such as goals, beliefs, desires, and intentions. Reasoning about the relation between behavior and mental states is therefore considered to be an effortful process. We argue that people use simple strategies to deal with high cognitive demands of mental state inference. To test this hypothesis, we developed a computational cognitive model, which was able to simulate previous empirical findings: In two-player games, people apply simple strategies at first. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  25. A computational model of affects.Mika Turkia - 2009 - In D. Dietrich, G. Fodor, G. Zucker & D. Bruckner (eds.), Simulating the mind: A technical neuropsychoanalytical approach. pp. 277-289.
    Emotions and feelings (i.e. affects) are a central feature of human behavior. Due to complexity and interdisciplinarity of affective phenomena, attempts to define them have often been unsatisfactory. This article provides a simple logical structure, in which affective concepts can be defined. The set of affects defined is similar to the set of emotions covered in the OCC model, but the model presented in this article is fully computationally defined, whereas the OCC model depends on undefined concepts. Following Matthis, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26.  73
    Modeling inference of mental states: As simple as possible, as complex as necessary.Ben Meijering, Niels A. Taatgen, Hedderik van Rijn & Rineke Verbrugge - 2014 - Interaction Studies 15 (3):455-477.
    Behavior oftentimes allows for many possible interpretations in terms of mental states, such as goals, beliefs, desires, and intentions. Reasoning about the relation between behavior and mental states is therefore considered to be an effortful process. We argue that people use simple strategies to deal with high cognitive demands of mental state inference. To test this hypothesis, we developed a computational cognitive model, which was able to simulate previous empirical findings: In two-player games, people apply simple strategies at first. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  27. Genome Informatics: The Role of DNA in Cellular Computations.James A. Shapiro - 2006 - Biological Theory 1 (3):288-301.
    Cells are cognitive entities possessing great computational power. DNA serves as a multivalent information storage medium for these computations at various time scales. Information is stored in sequences, epigenetic modifications, and rapidly changing nucleoprotein complexes. Because DNA must operate through complexes formed with other molecules in the cell, genome functions are inherently interactive and involve two-way communication with various cellular compartments. Both coding sequences and repetitive sequences contribute to the hierarchical systemic organization of the genome. By virtue of nucleoprotein (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  28. 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  
  29. 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   10 citations  
  30. 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  
  31. Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
    We overview logical and computational explanations of the notion of tractability as applied in cognitive science. We start by introducing the basics of mathematical theories of complexity: computability theory, computational complexity theory, and descriptive complexity theory. Computational philosophy of mind often identifies mental algorithms with computable functions. However, with the development of programming practice it has become apparent that for some computable problems finding effective algorithms is hardly possible. Some problems need (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  32. The Solution of the Invariant Subspace Problem. Complex Hilbert space. Part I.Jaykov Foukzon - 2022 - Journal of Advances in Mathematics and Computer Science 37 (10):51-89.
    Download  
     
    Export citation  
     
    Bookmark  
  33.  68
    Irreversibility and Complexity.Lapin Yair - manuscript
    Complexity is a relatively new field of study that is still heavily influenced by philosophy. However, with the advent of modern computing, it has become easier to conduct thorough investigations of complex systems using computational simulations. Despite significant progress, there remain certain characteristics of complex systems that are difficult to comprehend. To better understand these features, information can be applied using simple models of complex systems. The concepts of Shannon's information theory, Kolgomorov complexity, and logical depth (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. Implications of computer science theory for the simulation hypothesis.David Wolpert - manuscript
    Download  
     
    Export citation  
     
    Bookmark  
  35. Curious objects: How visual complexity guides attention and engagement.Zekun Sun & Chaz Firestone - 2021 - Cognitive Science: A Multidisciplinary Journal 45 (4):e12933.
    Some things look more complex than others. For example, a crenulate and richly organized leaf may seem more complex than a plain stone. What is the nature of this experience—and why do we have it in the first place? Here, we explore how object complexity serves as an efficiently extracted visual signal that the object merits further exploration. We algorithmically generated a library of geometric shapes and determined their complexity by computing the cumulative surprisal of their internal skeletons—essentially (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  36.  73
    On the computational complexity of ethics: moral tractability for minds and machines.Jakob Stenseke - 2024 - Artificial Intelligence Review 57 (105):90.
    Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  37. Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
    The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations and their mathematical descriptions emerging when a human (the researcher) starts to describe a Turing machine (the object of the study) (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  38. Adaptive ITS for Learning Computer Theory.Mohamed Nakhal & Bastami Bashhar - 2017 - European Academic Research 4 (10):8770-8782.
    In this paper, we present an intelligent tutoring system developed to help students in learning Computer Theory. The Intelligent tutoring system was built using ITSB authoring tool. The system helps students to learn finite automata, pushdown automata, Turing machines and examines the relationship between these automata and formal languages, deterministic and nondeterministic machines, regular expressions, context free grammars, undecidability, and complexity. During the process the intelligent tutoring system gives assistance and feedback of many types in an intelligent manner (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. The computable universe: from prespace metaphysics to discrete quantum mechanics.Martin Leckey - 1997 - Dissertation, Monash University
    The central motivating idea behind the development of this work is the concept of prespace, a hypothetical structure that is postulated by some physicists to underlie the fabric of space or space-time. I consider how such a structure could relate to space and space-time, and the rest of reality as we know it, and the implications of the existence of this structure for quantum theory. Understanding how this structure could relate to space and to the rest of reality requires, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Computing and philosophy: Selected papers from IACAP 2014.Vincent C. Müller (ed.) - 2016 - Cham: Springer.
    This volume offers very selected papers from the 2014 conference of the “International Association for Computing and Philosophy” (IACAP) - a conference tradition of 28 years. - - - Table of Contents - 0 Vincent C. Müller: - Editorial - 1) Philosophy of computing - 1 Çem Bozsahin: - What is a computational constraint? - 2 Joe Dewhurst: - Computing Mechanisms and Autopoietic Systems - 3 Vincenzo Fano, Pierluigi Graziani, Roberto Macrelli and Gino Tarozzi: - Are Gandy Machines really (...)
    Download  
     
    Export citation  
     
    Bookmark  
  41. 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  
  42. Theory of Everything, Ultimate Reality and the End of Humanity: Extended Sustainability by the Universal Science of Complexity.Andrei P. Kirilyuk - 2017 - Beau Bassin: LAP LAMBERT Academic Publishing.
    Instead of postulated fixed structures and abstract principles of usual positivistic science, the unreduced diversity of living world reality is consistently derived as dynamically emerging results of unreduced interaction process development, starting from its simplest configuration of two coupled homogeneous protofields. The dynamically multivalued, or complex and intrinsically chaotic, nature of these real interaction results extends dramatically the artificially reduced, dynamically single-valued projection of standard theory and solves its stagnating old and accumulating new problems, “mysteries” and “paradoxes” within the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43. By considering Fuzzy time, P=BPP (P*=BPP*).Farzad Didehvar - manuscript
    The reason ability of considering time as a fuzzy concept is demonstrated in [7],[8]. One of the major questions which arise here is the new definitions of Complexity Classes. In [1],[2],…,[11] we show why we should consider time a fuzzy concept. It is noticeable to mention that that there were many attempts to consider time as a Fuzzy concept, in Philosophy, Mathematics and later in Physics but mostly based on the personal intuition of the authors or as a style (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44. 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   4 citations  
  45. The impacts of Logic, Paradoxes in one side and Theory of Computation in the other side.Didehvar Farzad - manuscript
    This is a presentation about the impacts of Logic and Theory of Computation. It starts by some explanations about Theory of Computation and its relations with the other subjects in science. Then we have some explanations about paradoxes and some historical points. In continuation, we present some of the most important paradoxes. Forthcoming, Five subjects around the relations between Logic and Theory of computation is introduced. Finally, we present a new approach to solve P vs NP problem (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. Cognitive and Computational Complexity: Considerations from Mathematical Problem Solving.Markus Pantsar - 2019 - Erkenntnis 86 (4):961-997.
    Following Marr’s famous three-level distinction between explanations in cognitive science, it is often accepted that focus on modeling cognitive tasks should be on the computational level rather than the algorithmic level. When it comes to mathematical problem solving, this approach suggests that the complexity of the task of solving a problem can be characterized by the computational complexity of that problem. In this paper, I argue that human cognizers use heuristic and didactic tools and thus engage (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  47. The Solution of the Invariant Subspace Problem. Part I. Complex Hilbert space.Jaykov Foukzon - 2022 - Journal of Advances in Mathematics and Computer Science 37 (10):51-89.
    The incompleteness of set theory ZFC leads one to look for natural extensions of ZFC in which one can prove statements independent of ZFC which appear to be "true". One approach has been to add large cardinal axioms. Or, one can investigate second-order expansions like Kelley-Morse class theory, KM or Tarski- Grothendieck set theory TG [1]-[3] It is a non-conservative extension of ZFC and is obtaineed from other axiomatic set theories by the inclusion of Tarski's axiom which (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  48. Complex Organisation and Fundamental Physics.Brian D. Josephson - 2018 - Streaming Media Service, Cambridge University.
    The file on this site provides the slides for a lecture given in Hangzhou in May 2018, and the lecture itself is available at the URL beginning 'sms' in the set of links provided in connection with this item. -/- It is commonly assumed that regular physics underpins biology. Here it is proposed, in a synthesis of ideas by various authors, that in reality structures and mechanisms of a biological character underpin the world studied by physicists, in principle supplying detail (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49.  76
    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  
  50.  73
    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  
1 — 50 / 999