The instructional information processing account of digital computation.
What is nontrivial digital computation? It is the processing of discrete data through discrete state transitions in accordance with finite instructional information. The motivation for our account is that many previous attempts to answer this question are inadequate, and also that this account accor...
| Publicado en: | Synthese Vol. 191; no. 7; pp. 1469 - 1493 |
|---|---|
| Autores principales: | , |
| Formato: | Artículo |
| Publicado: |
Springer Nature
May2014
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=95298486&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 95298486 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00397857 4LI jtl: Synthese issn: 00397857 maglogo: N pubinfo: dt: May2014 vid: 191 iid: 7 pid: 237 pub: Springer Nature artinfo: ui: 95298486 10.1007/s11229-013-0338-5 ppf: 1469 ppct: 24 formats: fmt: @attributes: type: P size: 430KB tig: atl: The instructional information processing account of digital computation. aug: au: Fresco, Nir Wolf, Marty affil: Faculty of Engineering and Information Sciences, University of Wollongong (UoW), Northfields Avenue Wollongong 2522 Australia Department of Mathematics and Computer Science Hagg-Sauer 368, Bemidji State University #23, 1500 Birchmont Drive Bemidji 56601-2699 USA su: Information processing Electronic data processing Instructional systems design Turing machines Computer architecture sug: subj: Information processing Electronic data processing Instructional systems design Turing machines Computer architecture keyword: Computational taxonomy Digital computation Finite state automata Instructional information Physical computation ab: What is nontrivial digital computation? It is the processing of discrete data through discrete state transitions in accordance with finite instructional information. The motivation for our account is that many previous attempts to answer this question are inadequate, and also that this account accords with the common intuition that digital computation is a type of information processing. We use the notion of reachability in a graph to defend this characterization in memory-based systems and underscore the importance of instructional information for digital computation. We argue that our account evaluates positively against adequacy criteria for accounts of computation. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y custom: Synthese is a copyright of Springer, 2014. All Rights Reserved. item: Synthese holder: Springer Nature dt: @attributes: year: 2014 holdings: @attributes: islocal: N |
|---|