Turing Machines for Dummies (Q2891358)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Turing Machines for Dummies	scientific article

Statements

scholarly article

0 references

Turing Machines for Dummies (English)

0 references

Peter van Emde Boas

0 references

SOFSEM 2012: Theory and Practice of Computer Science

0 references

publication date

15 June 2012

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-27660-6_2

0 references

0 references

Domino-tiling games

0 references

0 references

Two-Tape Simulation of Multitape Turing Machines

0 references

Nondeterministic Space is Closed under Complementation

0 references

Register machine proof of the theorem on exponential diophantine representation of enumerable sets

0 references

0 references

0 references

A characterization of the power of vector machines

0 references

Relationships between nondeterministic and deterministic tape complexities

0 references

A simplified proof of the real-time recognizability of palindromes on Turing machines

0 references

0 references

0 references

0 references

On Computable Numbers, with an Application to the Entscheidungsproblem

0 references

0 references

0 references

0 references

0 references

An Optimal Simulation of Counter Machines

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-27660-6_2

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2891358

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2891358&oldid=35284391"