This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

110 found
Order:
1 — 50 / 110
  1. added 2020-05-16
    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 of (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  2. added 2020-05-13
    Отвъд машината на Тюринг: квантовият компютър.Vasil Penchev - 2014 - Sofia: BAS: ISSK (IPS).
    Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might (...)
    Remove from this list   Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  3. added 2019-09-11
    Fuzzy Time, From Paradox to Paradox.Farzad Didehvar - manuscript
    Although Fuzzy logic and Fuzzy Mathematics is a widespread subject and there is a vast literature about it, yet the use of Fuzzy issues like Fuzzy sets and Fuzzy numbers was relatively rare in time concept. This could be seen in the Fuzzy time series. In addition, some attempts are done in fuzzing Turing Machines but seemingly there is no need to fuzzy time. Throughout this article, we try to change this picture and show why it is helpful to consider (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  4. added 2019-08-05
    Proof Theory for Positive Logic with Weak Negation.Marta Bílková & Almudena Colacito - forthcoming - Studia Logica:1-38.
    Proof-theoretic methods are developed for subsystems of Johansson’s logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems. In particular, cut-free complete sequent calculi are introduced and used to provide a proof of the fact that the systems satisfy the Craig interpolation property. Alternative versions of the calculi are later obtained by means of an appropriate loop-checking history mechanism. Termination of the new calculi is proved, and (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5. added 2019-04-14
    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, it (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6. added 2018-06-08
    The Incoherence of Heuristically Explaining Coherence.Iris van Rooij & Cory Wright - 2006 - In Ron Sun (ed.), Proceedings of the 28th Annual Conference of the Cognitive Science Society. Mahwah, NJ 07430, USA: pp. 2622.
    Advancement in cognitive science depends, in part, on doing some occasional ‘theoretical housekeeping’. We highlight some conceptual confusions lurking in an important attempt at explaining the human capacity for rational or coherent thought: Thagard & Verbeurgt’s computational-level model of humans’ capacity for making reasonable and truth-conducive abductive inferences (1998; Thagard, 2000). Thagard & Verbeurgt’s model assumes that humans make such inferences by computing a coherence function (f_coh), which takes as input representation networks and their pair-wise constraints and gives as output (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  7. added 2018-02-24
    Incompleteness in the Finite Domain.Pavel Pudlák - 2017 - Bulletin of Symbolic Logic 23 (4):405-441.
    Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond NP ≠ coNP. These conjectures formally connect computational complexity with the difficulty of proving some sentences, which means that high computational complexity of a problem associated with a sentence implies that the sentence is not provable in a weak theory, or requires a long proof. Another reason for putting forward these conjectures is that some results in proof complexity seem to be (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  8. added 2018-02-17
    Implementation of Belief Change Operators Using BDDs.Nikos Gorogiannis & Mark D. Ryan - 2002 - Studia Logica 70 (1):131-156.
    While the theory of belief change has attracted a lot of interest from researchers, work on implementing belief change and actually putting it to use in real-world problems is still scarce. In this paper, we present an implementation of propositional belief change using Binary Decision Diagrams. Upper complexity bounds for the algorithm are presented and discussed. The approach is presented both in the general case, as well as on specific belief change operators from the literature. In an effort to gain (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  9. added 2018-02-16
    Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model.Jakub Szymanik & Marcin Zajenkowski - 2010 - Cognitive Science 34 (3):521-532.
    We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same problem and suggest extending their experimental setting. Moreover, we give some direct empirical evidence linking computational complexity predictions with cognitive reality.<br>In the empirical study we compare time needed for understanding different types of quantifiers. We show that the computational distinction between quantifiers recognized by finite-automata and push-down automata is psychologically relevant. Our research improves upon hypothesis and (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  10. added 2018-01-22
    Proof Compression and NP Versus PSPACE.L. Gordeev & E. H. Haeusler - 2019 - Studia Logica 107 (1):53-83.
    We show that arbitrary tautologies of Johansson’s minimal propositional logic are provable by “small” polynomial-size dag-like natural deductions in Prawitz’s system for minimal propositional logic. These “small” deductions arise from standard “large” tree-like inputs by horizontal dag-like compression that is obtained by merging distinct nodes labeled with identical formulas occurring in horizontal sections of deductions involved. The underlying geometric idea: if the height, h(∂), and the total number of distinct formulas, ϕ(∂), of a given tree-like deduction ∂ of a minimal (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11. added 2017-09-10
    Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer.Michael Cuffaro - 2018 - In Sven Hansson (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Springer. pp. 253-282.
    Computational complexity theory is a branch of computer science dedicated to classifying computational problems in terms of their difficulty. While computability theory tells us what we can compute in principle, complexity theory informs us regarding our practical limits. In this chapter I argue that the science of \emph{quantum computing} illuminates complexity theory by emphasising that its fundamental concepts are not model-independent, but that this does not, as some suggest, force us to radically revise the foundations of the theory. For model-independence (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12. added 2017-07-30
    Intractability and the Use of Heuristics in Psychological Explanations.Iris Rooij, Cory Wright & Todd Wareham - 2012 - Synthese 187 (2):471-487.
  13. added 2017-02-15
    Combinatorial Problems in Natural Sciences: Computational Complexity and Inherent Properties.Bruno Apolloni-Salvatore Di Gregorio - 1984 - Epistemologia 7:115-136.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  14. added 2017-02-12
    On the Complexity of the Pancake Problem.Fuxiang Yu - 2007 - Mathematical Logic Quarterly 53 (4):532-546.
    We study the computational complexity of finding a line that bisects simultaneously two sets in the two-dimensional plane, called the pancake problem, using the oracle Turing machine model of Ko. We also study the basic problem of bisecting a set at a given direction. Our main results are: (1) The complexity of bisecting a nice (thick) polynomial-time approximable set at a given direction can be characterized by the counting class #P. (2) The complexity of bisecting simultaneously two linearly separable nice (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15. added 2017-02-11
    Structural Database for Reducing Cost in Materials Design and Complexity of Multiscale Computations.Nikolai Zarkevich - 2006 - Complexity 11 (4):36-42.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16. added 2017-02-10
    Program-Size Complexity for Short Strings.Hector Zenil - unknown
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  17. added 2017-02-02
    Some Decision Problems of Enormous Complexity.Harvey Friedman - manuscript
    We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic logical notions. Their complexities range from iterated exponential time completeness to (0 time completeness to ((((,0) time completeness to ((((,,0) time completeness. These three ordinals are well known ordinals from proof theory, and their associated com- plexity classes represent new levels of computational complexity for natural decision problems. Proofs will appear in an extended version of (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  18. added 2017-01-29
    Computational Complexity of Solving Equation Systems.Przemysław Broniek - unknown
    We present conclusions and open problems raising from studying solving equations over unary algebras. We suggest areas that are most promising for expanding our knowledge.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  19. added 2017-01-28
    Communication Complexity.Eyal Kushilevitz & Noam Nisan - 1997
  20. added 2017-01-28
    Finite Automata, Formal Logic, and Circuit Complexity.Howard Straubing - 1994
  21. added 2017-01-26
    Computational Complexity Reduction and Interpretability Improvement of Distance-Based Decision Trees.Marcin Blachnik & Mirosław Kordos - 2012 - In Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michał Woźniak, Manuel Grana & Sung-Bae Cho (eds.), Hybrid Artificial Intelligent Systems. Springer. pp. 288--297.
  22. added 2017-01-26
    The Complexity of Industrial Ecosystems: Classification and Computational Modelling.James S. Baldwin - 2011 - In Peter Allen, Steve Maguire & Bill McKelvey (eds.), The Sage Handbook of Complexity and Management. Sage Publications. pp. 299.
  23. added 2017-01-26
    Reducing Negative Complexity by a Computational Semiotic System.Gerd Doben-Henisch - 2007 - In R. Gudwin & J. Queiroz (eds.), Semiotics and Intelligent Systems Development. Idea Group. pp. 330.
  24. added 2017-01-26
    Reducing Negative Complexity by a Computational Semiotic System.Gerd Döben Henisch - 2007 - In R. Gudwin & J. Queiroz (eds.), Semiotics and Intelligent Systems Development. Idea Group.
  25. added 2017-01-24
    Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control.Edith Hemaspaandra, Lane A. Hemaspaandra & Jörg Rothe - 2009 - Mathematical Logic Quarterly 55 (4):397-424.
    Electoral control refers to attempts by an election's organizer to influence the outcome by adding/deleting/partitioning voters or candidates. The important paper of Bartholdi, Tovey, and Trick [1] that introduces control proposes computational complexity as a means of resisting control attempts: Look for election systems where the chair's task in seeking control is itself computationally infeasible.We introduce and study a method of combining two or more candidate-anonymous election schemes in such a way that the combined scheme possesses all the resistances to (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26. added 2017-01-24
    On the Complexity of Finding Paths in a Two‐Dimensional Domain I: Shortest Paths.Arthur W. Chou & Ker-I. Ko - 2004 - Mathematical Logic Quarterly 50 (6):551-572.
    The computational complexity of finding a shortest path in a two-dimensional domain is studied in the Turing machine-based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial-time computable two-dimensional domains: domains with polynomialtime computable boundaries, and polynomial-time recognizable domains with polynomial-time computable distance functions. It is proved that the shortest path problem has the polynomial-space upper bound for domains of both type and type ; and it has a polynomial-space lower (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27. added 2017-01-24
    On the Relations Between Discrete and Continuous Complexity Theory.Klaus Meer - 1995 - Mathematical Logic Quarterly 41 (2):281-286.
    Relations between discrete and continuous complexity models are considered. The present paper is devoted to combine both models. In particular we analyze the 3-Satisfiability problem. The existence of fast decision procedures for this problem over the reals is examined based on certain conditions on the discrete setting. Moreover we study the behaviour of exponential time computations over the reals depending on the real complexity of 3-Satisfiability. This will be done using tools from complexity theory over the integers.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28. added 2017-01-16
    Membrane Fission: A Computational Complexity Perspective.Luis F. Macías-Ramos, Bosheng Song, Luis Valencia-Cabrera, Linqiang Pan & Mario J. Pérez-jiménez - 2016 - Complexity 21 (6):321-334.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29. added 2017-01-14
    Why Philosophers Should Care About Computational Complexity.Scott Aaronson - unknown
    One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In particular, I argue that computational complexity theory---the field that studies the resources needed to solve computational problems---leads to new perspectives on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume's problem of induction and Goodman's (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  30. added 2017-01-12
    On the Significance of the Gottesman–Knill Theorem.Michael E. Cuffaro - 2017 - British Journal for the Philosophy of Science 68 (1):91-121.
    According to the Gottesman–Knill theorem, quantum algorithms that utilize only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states, it is commonly concluded that entanglement is insufficient to enable quantum computers to outperform classical computers. I argue in this article that this conclusion is misleading. First, the statement of the theorem is, on reflection, already evident when we consider Bell’s and related inequalities in the context of (...)
    Remove from this list   Direct download (10 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  31. added 2016-12-08
    Semantic Bounds for Everyday Language.Marcin Mostowski & Jakub Szymanik - 2012 - Semiotica 2012 (188):363-372.
    We consider the notion of everyday language. We claim that everyday language is semantically bounded by the properties expressible in the existential fragment of second–order logic. Two arguments for this thesis are formulated. Firstly, we show that so–called Barwise's test of negation normality works properly only when assuming our main thesis. Secondly, we discuss the argument from practical computability for finite universes. Everyday language sentences are directly or indirectly verifiable. We show that in both cases they are bounded by second–order (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  32. added 2016-12-08
    Computational Complexity Analysis Can Help, but First We Need a Theory.Todd Wareham, Iris van Rooij & Moritz Müller - 2008 - Behavioral and Brain Sciences 31 (4):399-400.
    Leech et al. present a connectionist algorithm as a model of (the development) of analogizing, but they do not specify the algorithm's associated computational-level theory, nor its computational complexity. We argue that doing so may be essential for connectionist cognitive models to have full explanatory power and transparency, as well as for assessing their scalability to real-world input domains.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  33. added 2016-12-08
    The Epsilon Calculus and Herbrand Complexity.Georg Moser & Richard Zach - 2006 - Studia Logica 82 (1):133-155.
    Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand disjunctions of existential (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  34. added 2016-08-30
    The Semimeasure Property of Algorithmic Probability -- “Feature‘ or “Bug‘?Douglas Campbell - 2013 - In David L. Dowe (ed.), Algorithmic Probability and Friends: Bayesian Prediction and Artificial Intelligence. Springer Berlin Heidelberg. pp. 79--90.
    An unknown process is generating a sequence of symbols, drawn from an alphabet, A. Given an initial segment of the sequence, how can one predict the next symbol? Ray Solomonoff’s theory of inductive reasoning rests on the idea that a useful estimate of a sequence’s true probability of being outputted by the unknown process is provided by its algorithmic probability (its probability of being outputted by a species of probabilistic Turing machine). However algorithmic probability is a “semimeasure”: i.e., the sum, (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35. added 2016-02-24
    Quantifiers and Cognition: Logical and Computational Perspectives.Jakub Szymanik - 2016 - Springer.
    This volume on the semantic complexity of natural language explores the question why some sentences are more difficult than others. While doing so, it lays the groundwork for extending semantic theory with computational and cognitive aspects by combining linguistics and logic with computations and cognition. -/- Quantifier expressions occur whenever we describe the world and communicate about it. Generalized quantifier theory is therefore one of the basic tools of linguistics today, studying the possible meanings and the inferential power of quantifier (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  36. added 2016-02-17
    Human-Human Stigmergy.Ted Lewis & Leslie Marsh - 2016 - Cognitive Systems Research 38 (June):1-60.
  37. added 2016-01-06
    The Unexplained Intellect: Complexity, Time, and the Metaphysics of Embodied Thought.Christopher Mole - 2016 - Routledge.
    The relationship between intelligent systems and their environment is at the forefront of research in cognitive science. The Unexplained Intellect: Complexity, Time, and the Metaphysics of Embodied Thought shows how computational complexity theory and analytic metaphysics can together illuminate long-standing questions about the importance of that relationship. It argues that the most basic facts about a mind cannot just be facts about mental states, but must include facts about the dynamic, interactive mental occurrences that take place when a creature encounters (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  38. added 2015-11-13
    The Physical Church Thesis and Physical Computational Complexity.Itamar Pitowski - 1990 - Iyyun 39:81-99.
  39. added 2015-10-19
    Rational Analysis, Intractability, and the Prospects of ‘as If’-Explanations.Iris van Rooij, Cory D. Wright, Johan Kwisthout & Todd Wareham - 2018 - Synthese 195 (2):491-510.
    Despite their success in describing and predicting cognitive behavior, the plausibility of so-called ‘rational explanations’ is often contested on the grounds of computational intractability. Several cognitive scientists have argued that such intractability is an orthogonal pseudoproblem, however, since rational explanations account for the ‘why’ of cognition but are agnostic about the ‘how’. Their central premise is that humans do not actually perform the rational calculations posited by their models, but only act as if they do. Whether or not the problem (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  40. added 2015-09-29
    A Contradiction and P=NP Problem.Farzad Didehvar - manuscript
    Here, by introducing a version of “Unexpected hanging paradox” first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support it. Finally, we propose a claim in Theory of Computation about the consistency of this Theory. One of the major claim is:Theory of Computation and Classical Logic leads us to a contradiction.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  41. added 2015-06-27
    Quantum Computing.Amit Hagar & Michael Cuffaro - 2019 - Stanford Encyclopedia of Philosophy.
    Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm was soon followed by several (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  42. added 2015-03-28
    Computational Limitations of Small-Depth Circuits.Johan Håstad - 1987
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  43. added 2015-03-24
    1 Complexity of Computational Problems.D. B. Shmoys & E. Tardos - forthcoming - Complexity.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  44. added 2015-03-24
    Computational Complexity of Stochastic Programming Problems.Martin Dyer & Leen Stougie - 2005 - Complexity 1 (13):21.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  45. added 2015-03-23
    Thoughts on Complexity and Computational Models.Michael J. Prietula - 2011 - In Peter Allen, Steve Maguire & Bill McKelvey (eds.), The Sage Handbook of Complexity and Management. Sage Publications. pp. 93--110.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  46. added 2015-03-21
    Computational Complexity of Logical Theories of One Successor and Another Unary Function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.
    The first-order logical theory Th $({\mathbb{N}},x + 1,F(x))$ is proved to be complete for the class ATIME-ALT $(2^{O(n)},O(n))$ when $F(x) = 2^{x}$ , and the same result holds for $F(x) = c^{x}, x^{c} (c \in {\mathbb{N}}, c \ge 2)$ , and F(x) = tower of x powers of two. The difficult part is the upper bound, which is obtained by using a bounded Ehrenfeucht–Fraïssé game.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  47. added 2015-03-20
    Remarks on Computational Complexity: Response to Abels.Norbert Hornstein - 2013 - Mind and Language 28 (4):430-434.
  48. added 2015-03-20
    Quantified Propositional Calculus and a Second-Order Theory for NC1.Stephen Cook & Tsuyoshi Morioka - 2005 - Archive for Mathematical Logic 44 (6):711-749.
    Let H be a proof system for quantified propositional calculus. We define the Σqj-witnessing problem for H to be: given a prenex Σqj-formula A, an H-proof of A, and a truth assignment to the free variables in A, find a witness for the outermost existential quantifiers in A. We point out that the Σq1-witnessing problems for the systems G*1and G1 are complete for polynomial time and PLS, respectively. We introduce and study the systems G*0 and G0, in which cuts are (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  49. added 2015-03-20
    Computation Models for Parameterized Complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  50. added 2015-03-18
    Bracing for the Future: Complexity and Computational Ability in the Knowledge Era.Arnold J. Wytenburg - 2001 - Emergence: Complexity and Organization 3 (2):113-126.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 110