Interactive Foundations of Computing

Explore this paper's citation graph

Summary

Extensions to interactive models for algorithms, machines, grammars, and semantics are examined, and it is shown that interaction machines cannot be described by sound and complete first-order logics, and that incompleteness is inherently necessary to realize greater expressiveness.

Type
article
Published
1998-02-20
Cited by
230
References
37
Access
Open access

Keywords

Computer science, Turing machine, Theoretical computer science, Super-recursive algorithm, Abstract machine

References

Cited by

Related papers