Switch to: References

Add citations

You must login to add citations.
  1. Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.Michael Cuffaro - 2018 - In Hansson Sven Ove (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Cham, Switzerland: Springer Verlag. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Computers as Interactive Machines: Can We Build an Explanatory Abstraction?Alice Martin, Mathieu Magnaudet & Stéphane Conversy - 2023 - Minds and Machines 33 (1):83-112.
    In this paper, we address the question of what current computers are from the point of view of human-computer interaction. In the early days of computing, the Turing machine (TM) has been the cornerstone of the understanding of computers. The TM defines what can be computed and how computation can be carried out. However, in the last decades, computers have evolved and increasingly become interactive systems, reacting in real-time to external events in an ongoing loop. We argue that the TM (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Enaction-based artificial intelligence: Toward co-evolution with humans in the loop. [REVIEW]Pierre De Loor, Kristen Manac’H. & Jacques Tisseau - 2009 - Minds and Machines 19 (3):319-343.
    This article deals with the links between the enaction paradigm and artificial intelligence. Enaction is considered a metaphor for artificial intelligence, as a number of the notions which it deals with are deemed incompatible with the phenomenal field of the virtual. After explaining this stance, we shall review previous works regarding this issue in terms of artificial life and robotics. We shall focus on the lack of recognition of co-evolution at the heart of these approaches. We propose to explicitly integrate (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Enaction-Based Artificial Intelligence: Toward Co-evolution with Humans in the Loop.Pierre Loor, Kristen Manac’H. & Jacques Tisseau - 2009 - Minds and Machines 19 (3):319-343.
    This article deals with the links between the enaction paradigm and artificial intelligence. Enaction is considered a metaphor for artificial intelligence, as a number of the notions which it deals with are deemed incompatible with the phenomenal field of the virtual. After explaining this stance, we shall review previous works regarding this issue in terms of artificial life and robotics. We shall focus on the lack of recognition of co-evolution at the heart of these approaches. We propose to explicitly integrate (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • How to Make a Meaningful Comparison of Models: The Church–Turing Thesis Over the Reals.Maël Pégny - 2016 - Minds and Machines 26 (4):359-388.
    It is commonly believed that there is no equivalent of the Church–Turing thesis for computation over the reals. In particular, computational models on this domain do not exhibit the convergence of formalisms that supports this thesis in the case of integer computation. In the light of recent philosophical developments on the different meanings of the Church–Turing thesis, and recent technical results on analog computation, I will show that this current belief confounds two distinct issues, namely the extension of the notion (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations