Amanote Research

Amanote Research

    RegisterSign In

The Turing Machine Paradigm in Contemporary Computing

doi 10.1007/978-3-642-56478-9_59
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2001

Authors
Jan van LeeuwenJiří Wiedermann
Publisher

Springer Berlin Heidelberg


Related search

The Definition of Universal Turing Machine

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1957English

Model of Computation-Turing Machine

IOSR Journal of Computer Engineering
2014English

Program Algebra for Turing-Machine Programs

Scientific Annals of Computer Science
Applied MathematicsComputer Science
2019English

Implementation of Recursively Enumerable Languages in Universal Turing Machine

International Journal of Computer Theory and Engineering
2011English

Discourse Translation in Contemporary Linguistic Paradigm

Naukovy Visnyk of South Ukrainian National Pedagogical University named after K. D. Ushynsky: Linguistic Sciences
2019English

Data Mining in the Soft Computing Paradigm

English

The Proof of the Riemann Hypothesis on a Relativistic Turing Machine

International Journal of Theoretical and Applied Mathematics
2017English

A Dream of Simplicity: Scientific Computing on Turing Machines

Computing in Science and Engineering
EngineeringComputer Science
2017English

Developing Digital-To-Analog Converters and the Turing Machine Using Puy

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy