DSpace Repository :: Browsing by Subject "maszyna Turinga"

Thesis

Restricted

Badanie nierozstrzygalności pewnych problemów decyzyjnych dotyczących gramatyk bezkontekstowych

(Data obrony: 2019-09-18) Sędłak, Anna
Wydział Matematyki Stosowanej

Thesis

Restricted

Dowody o wiedzy zerowej Hipoteza Bluma

(Data obrony: 2010-06-28) Petecki, Paweł
Wydział Matematyki Stosowanej

Article

Open Access

Funkcje normalne jako nowy model definiowania funkcji obliczalnych

(2004) Dubiel, Leszek

Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way. Discovery of Ackermann function proved that not all functions that can be easily computed can be so easily described with Hilbert’s system of recursive functions. Normal functions lack this disadvantage.

Article

Open Access

Generowanie maszyn Turinga poprzez zastosowanie nowych modeli obliczeniowych

(Wydawnictwa AGH, 2003) Dubiel, Leszek

For each problem that can be solved there exists algorithm, which can be described with a program of Turing machine. 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 is to define a new model of computation that allows for quick and easy programming, and then to emulate its operation with Turing machine. This article shows how to define most suitable model for computation on natural numbers and defines Turing machine that emulates its operation.