scientific article; zbMATH DE number 1512850

MaRDI QIDQ4508548zbMATH OpenFDO

Authors Lioudmila Pavlotskaïa, M. Margenstern

Publication date 27 February 2001

zbMATH Keywords

computabilityrecursively enumerable setsTuring machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Recommendations

• scientific article; zbMATH DE number 2150282
• On Formalisms for Turing Machines
• Computability and Incomputability
• Classical Computability and Fuzzy Turing Machines
• The stability of Turing machine in computing real functions

Cited in

(19)

• Turing projectability
• Castor quadruplorum
• Turing machines for dummies. Why representations do matter
• Honest universality
• The ``paradox of computability and a recursive relative version of the busy beaver function
• Turing machines on Cayley graphs
• On reversible Turing machines and their function universality
• Observability of Turing machines: a refinement of the theory of computation
• The stability of Turing machine in computing real functions
• scientific article; zbMATH DE number 4094815 (Why is no real title available?)
• scientific article; zbMATH DE number 3521955 (Why is no real title available?)
• Some characterizations of functions computable in on-line arithmetic
• scientific article; zbMATH DE number 2150282 (Why is no real title available?)
• scientific article; zbMATH DE number 4114612 (Why is no real title available?)
• On non-computable functions
• Automata, Languages and Programming
• Symmetry of the universal computable function: a study of its automorphisms, homomorphisms and isomorphic embeddings
• On Formalisms for Turing Machines
• The dependence of computability on numerical notations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508548)