GENERATING TURING MACHINES BY USE OF OTHER COMPUTATION MODELS

Leszek Dubiel

Abstract


For each problem that can be solved there exists algorithm, which can be described with a program of Turing machin . Because this is very simple model programs tend to be very complicated and hard to analyse by human. The best practice to solve given type of problems istode neanewmodelofcomputationthatallowsforquickandeasyprogramming,andthen to emulate its operation with Turing machin . This article shows how to define most suitable model for computation on natural numbers and defines Turing machin that emulates its operation.


Full Text:

PDF

References


Brady J.M.: Informatyka teoretyczna w uj ciu programistycznym. Warszawa, WNT 1983

Davis M. D., Weyuker E. J.: Computability, complexity and languages - funda- mentals of theoretical Computer science. Orlando, Academic Press, Inc. 1983

Engeler E.: Introduction to the Theory of Computation. New Jork, Academic Press, Inc. 1973

Garding L.: Spotkanie z matematyk . Warszawa, Wydawnictwo Naukowe PWN 1993

Hare D.: Rzecz o istocie informatyki - algorytmika. Warszawa, WNT 1992

Ko cielski A.: Teoria oblicze - wyk ady z matematycznych podstaw informatyki.

Wroc aw, Wydawnictwo Uniwersytetu Wroc awskiego 1997

Kowal S.: 500 zagadek matematycznych. Warszawa, Wiedza Powszechna 1975

Penrose R.: Nowy umys cesarza - o komputerach, umy le i prawach fizyki. War

szawa, Wydawnictwo Naukowe PWN 1996

Trachtenbrot B. A.: Algorytmy i automatyczne rozwi zywanie zada . Warszawa, Pa stwowe Wydawnictwo Naukowe 1961

Wirth N.: Algorytmy + struktury danych = programy. Warszawa, WNT 199




DOI: https://doi.org/10.7494/csci.2003.5.1.3604

Refbacks

  • There are currently no refbacks.