Interactive foundations of computing

被引:91
|
作者
Wegner, P [1 ]
机构
[1] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA
关键词
turing machines; interaction; coordination; time; on-line algorithms; grammars; process models; games; logic; models; incompleteness; constraints; emergent behavior; empirical computer science;
D O I
10.1016/S0304-3975(97)00154-0
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The claim that interactive systems have richer behavior than algorithms is surprisingly easy to prove. Turing machines cannot model interaction machines (which extend Turing machines with interactive input/output) because interaction is not expressible by a finite initial input string. Interaction machines extend the Chomsky hierarchy, are modeled by interaction grammars, and precisely capture fuzzy concepts like open systems and empirical computer science. Computable functions cannot model real-world behavior because functions are too strong an abstraction, sacrificing the ability to model time and other real-world properties to realize formal tractability. Part I of this paper examines extensions to interactive models for algorithms, machines, grammars, and semantics, while Part II considers the expressiveness of different forms of interaction. Interactive identity machines are already more powerful than Turing machines, while noninteractive parallelism and distribution are algorithmic. The extension of Turing to interaction machines parallels that of the lambda to the pi calculus. Asynchronous and nonserializable interaction are shown to be more expressive than sequential interaction (multiple streams are more expressive than a single stream). In Part III, it is shown that interaction machines cannot be described by sound and complete first-order logics (a form of Godel incompleteness), and that incompleteness is inherently necessary to realize greater expressiveness. In the final section the robustness of interactive models in expressing open systems, programming in the large, graphical user interfaces, and agent-oriented artificial intelligence is compared to the robustness of Turing machines. Less technical discussion of these ideas may be found in [25-27]. Applications of interactive models to coordination, objects and components, patterns and frameworks, software engineering, and AI are examined elsewhere [28, 29]. The propositions P1-P36 embody the principal claims, while observations O1 through 040 provide additional insights.
引用
收藏
页码:315 / 351
页数:37
相关论文
共 50 条
  • [1] FOUNDATIONS OF SECURE INTERACTIVE COMPUTING
    BEAVER, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 576 : 377 - 391
  • [2] INTERACTIVE COMPUTING
    ARDEN, BW
    [J]. PROCEEDINGS OF THE IEEE, 1975, 63 (06) : 836 - 842
  • [3] A paradigm shift in interactive computing: Deriving multimodal design principles from behavioral and neurological foundations
    Stanney, K
    Samman, S
    Reeves, L
    Hale, K
    Buff, W
    Bowers, C
    Goldiez, B
    Nicholson, D
    Lackey, S
    [J]. INTERNATIONAL JOURNAL OF HUMAN-COMPUTER INTERACTION, 2004, 17 (02) : 229 - 257
  • [4] On the foundations of computing science
    Ferreira, U
    [J]. METAINFORMATICS, 2004, 3002 : 46 - 65
  • [5] Interactive repair and the foundations of language
    Dingemanse, Mark
    Enfield, N. J.
    [J]. TRENDS IN COGNITIVE SCIENCES, 2024, 28 (01) : 30 - 42
  • [6] INTERACTIVE INSTRUCTIONAL COMPUTING
    MEYERS, ED
    [J]. SOCIAL SCIENCE INFORMATION SUR LES SCIENCES SOCIALES, 1973, 12 (06): : 133 - 148
  • [7] The power of interactive computing
    Berghel, H
    [J]. COMMUNICATIONS OF THE ACM, 1997, 40 (09) : 20 - 21
  • [8] Interactive Granular Computing
    Skowron, Andrzej
    Jankowski, Andrzej
    [J]. ROUGH SETS AND KNOWLEDGE TECHNOLOGY, RSKT 2015, 2015, 9436 : 50 - 61
  • [9] AI and Interactive Computing
    Barnes, Susan B.
    [J]. IEEE INTELLIGENT SYSTEMS, 2011, 26 (04) : 9 - 9
  • [10] Interactive multimedia computing
    Wang, Meng
    Tang, Jinhui
    Hua, Xian-Sheng
    Chua, Tat-Seng
    [J]. MULTIMEDIA SYSTEMS, 2011, 17 (05) : 365 - 366