TITLE

A Remark on a Paper of I. V. Latkin

AUTHOR(S)
Leont’eva, M. N.
PUB. DATE
November 2013
SOURCE
Algebra & Logic;Nov2013, Vol. 52 Issue 5, p429
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The article offers the author's remark on the computational expressivity and recognition complexity of theories. The author mentions the primary theorem involving a Turing machine program along with the construction of its formula. An overview of the calculation of its value, variables and equivalent is also presented.
ACCESSION #
92902001

 

Related Articles

  • Alternating Time Versus Deterministic Time: A Separation. Gupta, S. // Mathematical Systems Theory;1996, Vol. 29 Issue 6, p661 

    Analyzes the Turing machine model of computation. Complexity theory; Speed-up of deterministic Turing machines; Time and speed hierarchies.

  • Uniqueness theorems for meromorphic mappings in several complex variables into P(â„‚) with two families of moving targets. Wang, Zhonghua; Tu, Zhenhan // Chinese Annals of Mathematics;Sep2013, Vol. 34 Issue 5, p719 

    The authors prove some uniqueness theorems for meromorphic mappings in several complex variables into the complex projective space P(â„‚) with two families of moving targets, and the results obtained improve some earlier work.

  • A Continuous Model of Computation. Traub, Joseph F. // Physics Today;May99, Vol. 52 Issue 5, p39 

    Suggests the use of real-number model of computation for scientific computation, instead of the Turing machine model. Two models of computation; Comparison of the Turing-machine model with the real-number model; Use in information-based complexity; Path integrals.

  • Volume of Torus and Its Applications Unconventionally. Bímová, Daniela; Bittnerová, Daniela // AIP Conference Proceedings;2016, Vol. 1789 Issue 1, p1 

    Many technical applications use objects having a shape of the torus. The aim of the paper is to show a new method how to calculate the volume of the torus. The method leads to an easier calculation because the double integral is used instead of the triple one, which is commonly found in...

  • The mathematics behind Jost Bürgi's method for calculating sine tables. Ullrich, Peter // PAMM: Proceedings in Applied Mathematics & Mechanics;Oct2016, Vol. 16 Issue 1, p891 

    Jost Bürgi (1552-1632) is not only one of the first persons who set up tables of logarithms for practical use but also invented a method to calculate highly precise tables of the sine function with small increment of the argument, and this with only a modest amount of calculations. Bürgi's...

  • Repairing the first nucleation theorem: Precritical cluster losses. Malila, Jussi; McGraw, Robert; Laaksonen, Ari; Lehtinen, Kari E. J. // AIP Conference Proceedings;May2013, Vol. 1527 Issue 1, p31 

    We have extended the kinetic derivation of the first nucleation theorem to account for losses of precritical clusters. Model calculations with coagulation scavenging show that if unaccounted for, these losses can lead to substantial errors in the interpretation of experimental data from...

  • Supermachines and Superminds. Steinhart, Eric // Minds & Machines;Feb2003, Vol. 13 Issue 1, p155 

    If the computational theory of mind is right, then minds are realized by machines. There is an ordered complexity hierarchy of machines. Some finite machines realize finitely complex minds; some Turing machines realize potentially infinitely complex minds. There are many logically possible...

  • Physical Hypercomputation and the Church–Turing Thesis. Shagrir, Oron; Pitowsky, Itamar // Minds & Machines;Feb2003, Vol. 13 Issue 1, p87 

    We describe a possible physical device that computes a function that cannot be computed by a Turing machine. The device is physical in the sense that it is compatible with General Relativity. We discuss some objections, focusing on those which deny that the device is either a computer or...

  • Computation and Hypercomputation. Stannett, Mike // Minds & Machines;Feb2003, Vol. 13 Issue 1, p115 

    Does Nature permit the implementation of behaviours that cannot be simulated computationally? We consider the meaning of physical computation in some detail, and present arguments in favour of physical hypercomputation: for example, modern scientific method does not allow the specification of...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics