Switch to: References

Citations of:

Computers Ltd: What They Really Can't Do

Oxford University Press (2003)

Add citations

You must login to add citations.
  1. Recursion Isn’t Necessary for Human Language Processing: NEAR (Non-iterative Explicit Alternatives Rule) Grammars are Superior.Kenneth R. Paap & Derek Partridge - 2014 - Minds and Machines 24 (4):389-414.
    Language sciences have long maintained a close and supposedly necessary coupling between the infinite productivity of the human language faculty and recursive grammars. Because of the formal equivalence between recursion and non-recursive iteration; recursion, in the technical sense, is never a necessary component of a generative grammar. Contrary to some assertions this equivalence extends to both center-embedded relative clauses and hierarchical parse trees. Inspection of language usage suggests that recursive rule components in fact contribute very little, and likely nothing significant, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Symbol grounding in computational systems: A paradox of intentions.Vincent C. Müller - 2009 - Minds and Machines 19 (4):529-541.
    The paper presents a paradoxical feature of computational systems that suggests that computationalism cannot explain symbol grounding. If the mind is a digital computer, as computationalism claims, then it can be computing either over meaningful symbols or over meaningless symbols. If it is computing over meaningful symbols its functioning presupposes the existence of meaningful symbols in the system, i.e. it implies semantic nativism. If the mind is computing over meaningless symbols, no intentional cognitive processes are available prior to symbol grounding. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On the Possibilities of Hypercomputing Supertasks.Vincent C. Müller - 2011 - Minds and Machines 21 (1):83-96.
    This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with Zeno-machines , i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zeno-machines falls into a dilemma: either they are specified such (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations