Van Leeuwen J., Wiedermann J., The Turing Machine Paradigm in Contemporary Computing, in. B. Enquist and W. Schmidt (eds.) Mathematics Unlimited - 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Turing Machines, Transition Systems, and Interaction - Goldin, Smolka, Wegner (2001) (1 citation) (Correct)
....Several researchers have recently observed that the Turing machine model of computation, the focus of which is on a theory of computable functions, falls short when it comes to modeling modern computing systems whose hallmarks are interaction and reactivity. For example, van Leeuwen in [LW00b] states: the classical Turing paradigm may no longer be fully appropriate to capture all features of present day computing. Also, Wegner[Weg98] has conjectured that interactive models of computation are more expressive than algorithmic ones such as Turing machines. It would therefore be ....
....systems. PTMs also formalize the notion of embedded components, according to the criteria presented in [LW00a] 13 Goldin et al. An alternative approach to extending the Turing machine model to interactive computation is captured by the Interactive Turing Machines with Advice (ITMAs) of [LW00b]. Like PTMs, ITMAs are persistent, interactive, and stream based. Additionally, they incorporate several features aimed at capturing practical computing devices, including multiple input output ports and advice, a kind of oracle modeling hardware and software upgrades. In contrast, PTMs, which ....
J. van Leeuwen and J. Wiedermann. The Turing machine paradigm in contemporary computing. In B. Enquist and W. Schmidt, editors, Mathematics Unlimited -
Peter Verbaan - Jan Van Leeuwen (2004) Self-citation (Van leeuwen Wiedermann) (Correct)
No context found.
J. van Leeuwen, J. Wiedermann. The Turing Machine Paradigm in Contemporary Computing, in: B. Enquist, W. Schmidt (Eds.), Mathematics Unlimited -
Lineages of Automata - Verbaan, van Leeuwen, Wiedermann (2004) Self-citation (Van leeuwen Wiedermann) (Correct)
No context found.
J. van Leeuwen, J. Wiedermann. The Turing Machine Paradigm in Contemporary Computing, in: B. Enquist, W. Schmidt (Eds.), Mathematics Unlimited -
A Computational Model of Interaction in Embedded Systems - van Leeuwen, Wiedermann (2001) (1 citation) Self-citation (Van leeuwen Wiedermann) (Correct)
....by Wegner s claim (cf. 29] that interactive computing is more powerful than algorithms . In the model we have tried to identify a number of properties which one would intuitively ascribe to a component of an embedded system that interacts with the environment in which it is placed. In [25] we have carried this further, to model some interactive features of the Internet and of global computing . In the latter case, the model includes the possibility of letting external information enter into the interaction process and of many components in uencing each other. In the present report ....
....the understanding of interactive computing and the possible implications for complexity theory. The further analysis of the model quickly leads to the consideration of non uniformly evolving, interactive machines and programs. The prospects of a theory that takes this into account are sketched in [25]. Acknowledgements We are grateful to D.Q. Goldin and T. Muntean for several useful comments and suggestions. Preliminary versions of the ideas in this report were included in presentations at IFIP TCS 2000 [23] and MFCS 2000 [24] We thank J E. Pin for useful discussions on the theory of ....
J. van Leeuwen, J. Wiedermann. The Turing machine paradigm in contemporary computing, Techn. Report UU-CS-2000-33, Dept of Computer Science, Utrecht University (2000), also in: B. Enquist and W. Schmidt (Eds), Mathematics Unlimited - 2001 and Beyond, Springer-Verlag, 2001 (to appear).
Unknown - Eugene Eberbach Comp (Correct)
No context found.
Van Leeuwen J., Wiedermann J., The Turing Machine Paradigm in Contemporary Computing, in. B. Enquist and W. Schmidt (eds.) Mathematics Unlimited - 2001.
Fundamenta Informaticae 68 (2005) 47--102 47 IOS Press - Calculus Of Bounded (Correct)
No context found.
Van Leeuwen J., Wiedermann J., The Turing Machine Paradigm in Contemporary Computing, 2001.
Turing Machines, Transition Systems, and Interaction - Goldin, Smolka, al. (2004) (1 citation) (Correct)
No context found.
J. van Leeuwen and J. Wiedermann. The Turing machine paradigm in contemporary computing. In B. Enquist and W. Schmidt, editors, Mathematics Unlimited - 2001 and Beyond. LNCS, Springer-Verlag, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC