67 papers:
STOC-2015-KoppulaLW #bound #memory management #obfuscation #turing machine- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory (VK, ABL, BW), pp. 419–428.
LICS-2015-AckermanFL #feedback- Feedback Turing Computability, and Turing Computability as Feedback (NLA, CEF, RSL), pp. 523–534.
ICALP-v2-2014-BorelloCV #automaton #set- Turing Degrees of Limit Sets of Cellular Automata (AB, JC, PV), pp. 74–85.
- LICS-CSL-2014-KlinLOT #complexity #constraints #problem #turing machine
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexity (BK, SL, JO, ST), p. 10.
DLT-2013-Freivalds #automaton #finite #turing machine- Ultrametric Finite Automata and Turing Machines (RF), pp. 1–11.
LATA-2013-ZakS #distance #turing machine- A Turing Machine Distance Hierarchy (SZ, JS), pp. 570–578.
SKY-2013-ExmanK #anti #network #recommendation #social- An Anti-Turing Test: Social Network Friends’ Recommendations (IE, AK), pp. 55–61.
- LICS-2013-BojanczykKLT #turing machine
- Turing Machines with Atoms (MB, BK, SL, ST), pp. 183–192.
SAT-2013-Clarke #why- Turing’s Computable Real Numbers and Why They Are Still Important Today (EMC), p. 18.
ITiCSE-2012-Blum- Alan turing and the other theory of computation (LB), p. 2.
- ITiCSE-2012-FaginS #education #named
- MyTuringTable: a teaching tool to accompany Turing’s original paper on computability (BF, DS), pp. 333–338.
- ITiCSE-2012-Harel #experience
- Standing on the shoulders of a giant: one person’s experience of turing’s impact (DH), p. 3.
- DLT-J-2011-ArrighiD12 #physics #quantum
- The Physical Church-Turing Thesis and the Principles of Quantum Theory (PA, GD), pp. 1131–1146.
- ICALP-v2-2012-Harel #experience #summary
- Standing on the Shoulders of a Giant — One Persons Experience of Turings Impact (Summary of the Alan M. Turing Lecture) (DH), pp. 16–22.
- LATA-2012-CiobanuP #petri net
- Catalytic Petri Nets Are Turing Complete (GC, GMP), pp. 192–203.
- LATA-2012-Dowek #automaton #formal method #physics #quantum
- Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (GD), pp. 21–37.
- LATA-2012-IbarraT #automaton #multi #turing machine
- Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines (OHI, NQT), pp. 337–350.
HILT-2012-Liskov #programming #turing machine- Keynote presentation: Programming the turing machine (BL), pp. 23–24.
- LICS-2012-Constable #on the
- On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer (RLC), pp. 2–8.
- LICS-2012-Levin #internet #what
- Turing’s Password: What Internet Cannot Leak (LAL), p. 11.
RTA-2012-SattlerB #equation #polymorphism- Turing-Completeness of Polymorphic Stream Equation Systems (CS, FB), pp. 256–271.
- ITiCSE-2011-Goldweber #learning #process #turing machine
- Two kinesthetic learning activities: turing machines and basic computer organization (MG), p. 335.
FoSSaCS-2011-Jacobs #algebra #quantum- Coalgebraic Walks, in Quantum and Turing Computation (BJ0), pp. 12–26.
- LATA-2011-AxelsenG #performance #turing machine
- A Simple and Efficient Universal Reversible Turing Machine (HBA, RG), pp. 117–128.
SLE-2010-BarrocaLAFS #model transformation #named- DSLTrans: A Turing Incomplete Transformation Language (BB, LL, VA, RF, VS), pp. 296–305.
- ITiCSE-2008-Garcia-OsorioMJG #automaton #education #turing machine
- Teaching push-down automata and turing machines (CGO, IMS, JJV, NGP), p. 316.
CIAA-2008-HempelK #persistent #turing machine- Persistent Computations of Turing Machines (HH, MK), pp. 171–180.
- LATA-2008-Petersen #sorting #turing machine
- Sorting and Element Distinctness on One-Way Turing Machines (HP), pp. 433–439.
ICLP-2008-Sneyers #subclass- Turing-Complete Subclasses of CHR (JS), pp. 759–763.
- FoSSaCS-2006-OuaknineW #logic #metric #on the #turing machine
- On Metric Temporal Logic and Faulty Turing Machines (JO, JW), pp. 217–230.
- CIAA-2006-OnderB #proving
- XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof (RO, ZB), pp. 275–276.
- ITiCSE-2005-ChenM #java #programming
- Iconic programming for flowcharts, java, turing, etc (SC, SM), pp. 104–107.
- ICALP-2005-AsarinC #turing machine
- Noisy Turing Machines (EA, PC), pp. 1031–1042.
- ICALP-2004-DurandMUV #turing machine
- Ecological Turing Machines (BD, AAM, MU, NKV), pp. 457–468.
- DLT-2002-SasakiIIW #2d #bound #probability #turing machine
- A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines (YS, KI, AI, YW), pp. 185–196.
ICDAR-2001-CoatesFB- Pessimal Print: A Reverse Turing Test (ALC, RJF, HSB), pp. 1154–1158.
- DLT-2001-KudlekR #turing machine
- A Universal Turing Machine with 3 States and 9 Symbols (MK, YR), pp. 311–318.
- LICS-2001-AsarinB #hybrid #turing machine
- Perturbed Turing Machines and Hybrid Systems (EA, AB), pp. 269–278.
- LICS-2000-Kripke #algorithm #first-order #theorem
- From the Church-Turing Thesis to the First-Order Algorithm Theorem (SK), p. 177.
- ICALP-1999-WeihrauchZ
- The Wave Propagator Is Turing Computable (KW, NZ), pp. 697–707.
HT-1998-Rosenberg #game studies #programmable- Locus Looks at the Turing Play: Hypertextuality vs. Full Programmability (JR), pp. 152–160.
- ITiCSE-1998-Taylor
- Motivating the Church-Turing thesis in the twenty-first century (RGT), pp. 228–231.
- STOC-1995-CuckerKKLW #on the #turing machine
- On real Turing machines that toss coins (FC, MK, PK, TL, KW), pp. 335–342.
- DLT-1995-Banik #turing machine
- Colonies as Systems of Turing Machines Without States (IB), pp. 189–198.
- ICALP-1993-Yamamoto #bound #nondeterminism #trade-off #turing machine
- Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines (HY), pp. 203–214.
CSL-1992-Aanderaa #turing machine- A Universal Turing Machine (SA), pp. 1–4.
- CSL-1990-Habart
- Randomness and Turing Reducibility Restraints (KH), pp. 234–247.
- RTA-1989-Dauchet #linear #simulation #turing machine
- Simulation of Turing Machines by a Left-Linear Rewrite Rule (MD), pp. 109–120.
- ICALP-1988-DietzfelbingerM #complexity #matrix #turing machine
- The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape (MD, WM), pp. 188–200.
- ICALP-1988-TangB #polynomial #reduction #set
- Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets (ST, RVB), pp. 591–599.
PLDI-1987-CordyG #design- Design of an interpretive environment for Turing (JRC, TCNG), pp. 199–204.
- STOC-1987-MaassSS #turing machine
- Two Tapes Are Better than One for Off-Line Turing Machines (WM, GS, ES), pp. 94–100.
- STOC-1986-GalilKS #graph #nondeterminism #on the #simulation #turing machine
- On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines (ZG, RK, ES), pp. 39–49.
- STOC-1984-Maass #bound #nondeterminism #polynomial #turing machine
- Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract) (WM), pp. 401–408.
- STOC-1982-InoueTT #2d #turing machine
- Two-Dimensional Alternating Turing Machines (KI, IT, HT), pp. 37–46.
- STOC-1982-Vitanyi #multi #realtime #simulation #turing machine
- Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines (PMBV), pp. 27–36.
- STOC-1981-Simon #bound #complexity #probability #turing machine
- Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version) (JS), pp. 158–167.
- ICALP-1979-MonienS #nondeterminism #on the #turing machine
- On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space (BM, IHS), pp. 431–445.
- ICALP-1978-Biskup #metric #turing machine
- Path Measures of Turing Machine Computations (Preliminary Report) (JB), pp. 90–104.
- ICALP-1977-SavitchV #linear #multi #simulation #turing machine
- Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps (WJS, PMBV), pp. 453–464.
- ICALP-1976-GillS #metric #turing machine
- Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures (JG, IS), pp. 285–306.
- STOC-1974-Gill #complexity #probability #turing machine
- Computational Complexity of Probabilistic Turing Machines (JTGI), pp. 91–95.
- ICALP-1974-Weicker #memory management #turing machine
- Turing Machines with Associative Memory Access (RW), pp. 458–472.
- STOC-1972-JonesS #first-order #similarity #turing machine
- Turing Machines and the Spectra of First-Order Formulas with Equality (NDJ, ALS), pp. 157–167.
- ICALP-1972-Monien #automaton #bound #turing machine
- Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.
- STOC-1970-BookGW #bound
- Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract (RVB, SAG, BW), pp. 92–99.
- STOC-1969-Savitch #nondeterminism #simulation #turing machine
- Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract) (WJS), pp. 247–248.
