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.

  • 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...

  • A SIMPLE PROOF OF THE CHANGE OF VARIABLE THEOREM FOR THE RIEMANN INTEGRAL. Tandra, Haryono // Teaching of Mathematics;2015, Vol. 18 Issue 1, p25 

    In this note, we present a simple proof of the change of variable theorem for the Riemann integral. The proof gives an alternate approach of how a class material on this topic can sistematically be carried out through a simple, succinct, and convenient way.

  • 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...

  • The equivalence of theories that characterize ALogTime. Nguyen, Phuong // Archive for Mathematical Logic;Jul2009, Vol. 48 Issue 6, p523 

    A number of theories have been developed to characterize ALogTime (or uniform NC1, or just NC1), the class of languages accepted by alternating logtime Turing machines, in the same way that Buss’s theory $${{\bf S}^{1}_{2}}$$ characterizes polytime functions. Among these, ALV′ (by...

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