54 research outputs found

    On machines, universal by extensions

    Get PDF
    AbstractA new definition of universal Turing machines is introduced which allows to obtain universal Turing machines with a very small number of program instructions. Here such a program with only seventeen instructions is supplied

    Modeling of the distribution of 137-Cs radionuclide in the Didoriv’s ponds cascade

    No full text

    137ĐĄs distribution in sod-podzol forest soil of Ukrainian Polissia

    No full text

    The complexity of small universal Turing machines : a survey

    Get PDF
    We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines of Minsky, Rogozhin, Baiocchi and Kudlek are efficient (polynomial time) simulators of Turing machines. These are some of the most intuitively simple computational devices and previously the best known simulations were exponentially slow. We discuss recent work that shows that these machines are indeed efficient simulators. In addition, another related result shows that Rule 110, a well-known elementary cellular automaton, is efficiently universal. We also discuss some old and new universal program size results, including the smallest known universal Turing machines. We finish the survey with results on generalised and restricted Turing machine models including machines with a periodic background on the tape (instead of a blank symbol), multiple tapes, multiple dimensions, and machines that never write to their tape. We then discuss some ideas for future work.Science Foundation IrelandExtended version of Theoretical Computer Science 410(4-5), Feburary 2009, pp 443-450 so I'm adding doi and rights info for Elsevier: not sure if that's right? - AV 11/10/2011 ke - kpw10/11/1

    Determining cao concentrations by flame photometry

    No full text
    • …
    corecore