Title :
Turing Machines with Atoms
Author :
Mikolaj Bojanczyk;Bartek Klin;Slawomir Lasota;Szymon Torunczyk
Abstract :
We study Turing machines over sets with atoms, also known as nominal sets. Our main result is that deterministic machines are weaker than nondeterministic ones; in particular, P≠NP in sets with atoms. Our main construction is closely related to the Cai-Furer-Immerman graphs used in descriptive complexity theory.
Keywords :
"Turing machines","Law","Orbits","Magnetic heads","Computational modeling","Polynomials"
Conference_Titel :
Logic in Computer Science (LICS), 2013 28th Annual IEEE/ACM Symposium on
Print_ISBN :
978-1-4799-0413-6
DOI :
10.1109/LICS.2013.24
