STM Journals Peer-reviewed research from Consortium e-Learning Network

3 publications

  • Published Subscription

    Inductively Computable Sets and Functions

    By Mark Burgin

    Abstract: AbstractInductive computations are used in many areas of computer and network technology. Inductive reasoning forms the base for scientific exploration. A mathematical model of inductive computations and reasoning is called an inductive Turing machine, which is a natural extension of the most popular model of computing devices and computations - Turing machine. In comparison with Turing machines, inductive Turing machines represent the next step in the development of computer science …

    Published in Journal of Computer Technology & Applications · Vol. 7, Issue 1, 2016 · pp. 12–21 Read article

  • Published Subscription

    Grammars with Exclusion

    By Mark Burgin

    Abstract: AbstractFormal grammars represent a practical tool for description and processing programming languages, as well as for modeling and study of natural languages. In this paper, we introduce and study a new type of formal grammars—grammars with exclusion. Procedures of language generation by grammars with exclusion are elaborated. In contrast to conventional formal grammars, one grammar with exclusion can generate several types of languages. It isdemonstrated that they have essentially higher …

    Published in Journal of Computer Technology & Applications · Vol. 6, Issue 2, 2015 · pp. 56–66 Read article

  • Published Subscription

    Periodic Turing Machines

    By Mark Burgin

    Abstract: AbstractIt is proved that in comparison with Turing machines, inductive Turing machines represent the next step in the development of computer science providing better models for contemporary computers and computer networks. In particular, it is proved that simple inductive Turing machines can solve the Halting Problem for Turing machines, while inductive Turing machines of higher orders can generate and decide the whole arithmetical hierarchy. It means that inductive Turing machines …

    Published in Journal of Computer Technology & Applications · Vol. 5, Issue 3, 2014 · pp. 6–18 Read article

Support