Search results for "TURING"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
34	Mavis Batey	Breaking machines with a pencil.	The Turing Guide	2017	DBLP BibTeX RDF
34	Joel Greenberg	The Enigma machine.	The Turing Guide	2017	DBLP BibTeX RDF
34	Eleanor Ireland	We were the world's first computer operators.	The Turing Guide	2017	DBLP BibTeX RDF
34	Edward Simpson	Banburismus revisited: depths and Bayes.	The Turing Guide	2017	DBLP BibTeX RDF
34	Jerry Roberts	The Testery: breaking Hitler's most secret code.	The Turing Guide	2017	DBLP BibTeX RDF
34	Jack Copeland, Jonathan P. Bowen	Life and work.	The Turing Guide	2017	DBLP BibTeX RDF
34	Jack Copeland	Hilbert and his famous problem.	The Turing Guide	2017	DBLP BibTeX RDF
34	Jack Copeland, Dani Prinz	Computer chess - the first moments.	The Turing Guide	2017	DBLP BibTeX RDF
34	Margaret A. Boden	Pioneer of artificial life.	The Turing Guide	2017	DBLP BibTeX RDF
34	Jack Copeland	Delilah - encrypting speech.	The Turing Guide	2017	DBLP BibTeX RDF
34	Brian Randell	Ultra revelations.	The Turing Guide	2017	DBLP BibTeX RDF
34	Martin Davis	Algorithms, Equations, and Logic.	The Once and Future Turing	2016	DBLP DOI BibTeX RDF
34	Roger Penrose	On Attempting to Model the Mathematical Mind.	The Once and Future Turing	2016	DBLP DOI BibTeX RDF
34	Douglas Richard Hofstadter	Dull Rigid Human meets Ace Mechanical Translator.	The Once and Future Turing	2016	DBLP DOI BibTeX RDF
34	Christof Teuscher	Designed versus Intrinsic Computation.	The Once and Future Turing	2016	DBLP DOI BibTeX RDF
34	Andrew Hodges	Preface.	The Once and Future Turing	2016	DBLP DOI BibTeX RDF
34		Afterword.	The Once and Future Turing	2016	DBLP DOI BibTeX RDF
34		Introduction.	The Once and Future Turing	2016	DBLP DOI BibTeX RDF
34	Muhammad Abuzar Fahiem	A Deterministic Turing Machine for Context Sensitive Translation of Braille Codes to Urdu Text.	IWCIA	2008	DBLP DOI BibTeX RDF	optical recognition, context sensitive translation, deterministic Turing machine, Urdu glyphs, Braille
34	Jonathan P. Sorenson	An honors course on Alan M. Turing.	ACM SIGCSE Bull.	2005	DBLP DOI BibTeX RDF	honors course, non-majors course, cryptography, artificial intelligence, Alan Turing
34	William G. Morein, Angelos Stavrou, Debra L. Cook, Angelos D. Keromytis, Vishal Misra, Dan Rubenstein	Using graphic turing tests to counter automated DDoS attacks against web servers.	CCS	2003	DBLP DOI BibTeX RDF	graphic turing tests, Java, web proxies
34	Qing Li, Chuguang Zheng, Nengchao Wang, Baochang Shi	LBGK Simulations of Turing Patterns in CIMA Model.	J. Sci. Comput.	2001	DBLP DOI BibTeX RDF	reaction-diffusion equation, Turing patterns, CIMA model, lattice Boltzmann method
34	Richard C. Holt	Introducing undergraduates to object orientation using the Turing language.	SIGCSE	1994	DBLP DOI BibTeX RDF	TURING
31	Gualtiero Piccinini	Computationalism, The Church-Turing Thesis, and the Church-Turing Fallacy.	Synth.	2007	DBLP DOI BibTeX RDF
30	Sanjay Jain 0001, Frank Stephan 0001, Jason Teutsch	Index Sets and Universal Numberings.	CiE	2009	DBLP DOI BibTeX RDF
30	Benedikt Löwe	Space Bounds for Infinitary Computation.	CiE	2006	DBLP DOI BibTeX RDF
30	Holger Spakowski, Rahul Tripathi	On the Power of Unambiguity in Alternating Machines.	FCT	2005	DBLP DOI BibTeX RDF
30	Harry Buhrman, Leen Torenvliet	Separating Complexity Classes Using Structural Properties.	CCC	2004	DBLP DOI BibTeX RDF
30	Richard Beigel, Lance Fortnow, Frank Stephan 0001	Infinitely-Often Autoreducible Sets.	ISAAC	2003	DBLP DOI BibTeX RDF
30	Todd Ebert, Wolfgang Merkle	Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits.	MFCS	2002	DBLP DOI BibTeX RDF
30	Masahiro Kitagawa	Experimental Quantum Computation with Molecules.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
30	Mitsunori Ogihara, Seinosuke Toda	The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.	MFCS	2001	DBLP DOI BibTeX RDF
30	Iannis Tourlakis	Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines.	CCC	2000	DBLP DOI BibTeX RDF
30	Arfst Nickelsen	Deciding Verbose Languages with Linear Advice.	MFCS	1997	DBLP DOI BibTeX RDF
30	Henrik Reif Andersen, Simon Mørk, Morten Ulrik Sørensen	A Universal Reactive Machine.	CONCUR	1997	DBLP DOI BibTeX RDF
30	Ingrid Biehl	Definition and Existence of Super Complexity Cores.	ISAAC	1994	DBLP DOI BibTeX RDF
30	Erich Grädel	Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier Alternations.	STACS	1988	DBLP DOI BibTeX RDF
30	John Cocke, Marvin Minsky	Universality of Tag Systems with P=2.	J. ACM	1964	DBLP DOI BibTeX RDF
30	Billy Schonenberg, Christoph Bartneck	Mysterious machines.	HRI	2010	DBLP DOI BibTeX RDF	religion, exhibition, chatbot, turing
30	Yves Younan, Pieter Philippaerts, Frank Piessens, Wouter Joosen, Sven Lachmund, Thomas Walter 0001	Filter-resistant code injection on ARM.	CCS	2009	DBLP DOI BibTeX RDF	alphanumeric shellcode, filter-resistance, turing completeness
30	Mika Luma Tuomola, Teemu Korpilahti, Jaakko Pesonen, Abhigyan Singh, Robert Villa, P. Punitha 0001, Yue Feng, Joemon M. Jose	Concept, content and the convict.	ACM Multimedia	2009	DBLP DOI BibTeX RDF	online production, image retrieval, art installation, Alan Turing
30	Shuji Isobe, Eisuke Koizumi, Yuji Nishigaki, Hiroki Shizuya	On the Complexity of Computing Discrete Logarithms over Algebraic Tori.	CANS	2009	DBLP DOI BibTeX RDF	algebraic tori, order certified discrete logarithms, Turing reduction
30	David Soloveichik, Matthew Cook 0001, Erik Winfree, Jehoshua Bruck	Computation with finite stochastic chemical reaction networks.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Stochastic chemical kinetics, Molecular counts, Turing-universal computation, Probabilistic computation
30	Peizhou He, Yong Sun, Wei Zheng 0001, Xiangming Wen	Filtering Short Message Spam of Group Sending Using CAPTCHA.	WKDD	2008	DBLP DOI BibTeX RDF	SMS spam (short message service spam), group sending, CAPTCHA (Completely Automated Public Turing test to tell Computers and Human Apart), (OCR) Optical Character Recognition, user authentication
30	Jirí Wiedermann, Jan van Leeuwen	How We Think of Computing Today.	CiE	2008	DBLP DOI BibTeX RDF	evolving automata, non-uniform complexity, Turing machines, interactive computation
30	Raúl Rojas 0001	Reviews.	IEEE Ann. Hist. Comput.	2007	DBLP DOI BibTeX RDF	early computers, history of typewriting, business data processing technology, life insurance industry, hacker pranks, geodesy, Alan Turing
30	Andrew Hodges, James W. Cortada	Reviews.	IEEE Ann. Hist. Comput.	2006	DBLP DOI BibTeX RDF	spies, Soviet computing, artificial intelligence, learning machines, Alan Turing
30	Alexey V. Chernov, Jürgen Schmidhuber	Prefix-Like Complexities and Computability in the Limit.	CiE	2006	DBLP DOI BibTeX RDF	limit computability, generalized Turing machine, non-halting computation, Kolmogorov complexity
30	Michal Armoni, Judith Gal-Ezer	On the achievements of high school students studying computational models.	ITiCSE	2004	DBLP DOI BibTeX RDF	computer-related background, mathematics level, computational model, finite automata, turing machines, pushdown automata
30	Arnold Beckmann	A Note on Universal Measures for Weak Implicit Computational Complexity.	LPAR	2002	DBLP DOI BibTeX RDF	Dynamic ordinals, Witness oracle TURING machines, Weak implicit computational complexity, Bounded arithmetic
30	Liming Cai, Jianer Chen, Johan Håstad	Circuit Bottom Fan-in and Computational Power.	CCC	1997	DBLP DOI BibTeX RDF	computational complexity, lower bound, circuit complexity, alternating Turing machine
30	Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers	Inverting Onto Functions.	CCC	1996	DBLP DOI BibTeX RDF	function classes, total functions, nondeterministic Turing machines, unambiguous computation, Computational complexity, invertibility
30	Georg Gottlob	Collapsing Oracle-Tape Hierarchies.	CCC	1996	DBLP DOI BibTeX RDF	tape, logspace, logarithmic space, machine model, complexity, query, oracle, circuit, Turing machine, generalized quantifier, relativization, bounded queries
29	John Watrous	On One-Dimensional Quantum Cellular Automata.	FOCS	1995	DBLP DOI BibTeX RDF	one-dimensional quantum cellular automata, quantum computational model, one dimensional quantum cellular automata, quantum Turing machine, constant slowdown, one dimensional partitioned quantum cellular automata, linear slowdown, 1D partitioned quantum cellular automaton simulation, simulation, cellular automata, quantum computation, quantum computers, physics, physics computing, Turing machines, quantum theory
29	Seinosuke Toda	The Complexity of Finding Medians	FOCS	1990	DBLP DOI BibTeX RDF	1-Turing reducible, finding medians, PF(Hash P), metric Turing machines, complexity, MidP
29	Ian Parberry	A Note on Nondeterminism in Small, Fast Parallel Computers.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	nondeterministic analogues, fast parallel computers, language classes, SC, NNC, NSC, deterministic Turing machine, polylog tape-head reversals, POLYLOGSPACE, simultaneous polynomial time, read-only input tape, read-write work tape, computational complexity, parallel computation, parallel machines, formal languages, nondeterminism, Turing machines, subset, NC
27	Shlomi Dolev, Yuval Nir	Optical Designs for Non-deterministic Turing Machines.	OSC	2009	DBLP DOI BibTeX RDF
27	Holger Petersen 0001	Sorting and Element Distinctness on One-Way Turing Machines.	LATA	2008	DBLP DOI BibTeX RDF
27	Damien Woods, Turlough Neary	Small Semi-weakly Universal Turing Machines.	MCU	2007	DBLP DOI BibTeX RDF
27	Joshua J. Arulanandham	Unconventional "Stateless" Turing-Like Machines.	UC	2007	DBLP DOI BibTeX RDF
27	Chi Tat Chong, Liang Yu	Thin Maximal Antichains in the Turing Degrees.	CiE	2007	DBLP DOI BibTeX RDF
27	Jingbo Hao, Jianping Yin, Boyun Zhang	A Computational Model of Computer Worms Based on Persistent Turing Machines.	IEEE ICCI	2006	DBLP DOI BibTeX RDF
27	Benjamín René Callejas Bedregal, Santiago Figueira	Classical Computability and Fuzzy Turing Machines.	LATIN	2006	DBLP DOI BibTeX RDF
27	Eugene Asarin, Pieter Collins	Noisy Turing Machines.	ICALP	2005	DBLP DOI BibTeX RDF
27	Robert Rettinger, Xizhong Zheng	On the Turing Degrees of Divergence Bounded Computable Reals.	CiE	2005	DBLP DOI BibTeX RDF
27	Philip D. Welch	The Transfinite Action of 1 Tape Turing Machines.	CiE	2005	DBLP DOI BibTeX RDF
27	Tero Harju, Maurice Margenstern	Splicing Systems for Universal Turing Machines.	DNA	2004	DBLP DOI BibTeX RDF
27	Cezar Câmpeanu, Andrei Paun	Computing Beyond the Turing Limit Using the H Systems.	DNA	2004	DBLP DOI BibTeX RDF
27	Feng-Long Huang, Ming-Shing Yu	Study on Good-Turing and a novel smoothing method based on real corpora for language models.	SMC (4)	2004	DBLP DOI BibTeX RDF
27	Antoine Joux, Frédéric Muller	A Chosen IV Attack Against Turing.	Selected Areas in Cryptography	2003	DBLP DOI BibTeX RDF
27	Alon Orlitsky, Narayana P. Santhanam, Junan Zhang	Always Good Turing: Asymptotically Optimal Probability Estimation.	FOCS	2003	DBLP DOI BibTeX RDF
27	Gregory G. Rose, Philip Hawkes	Turing: A Fast Stream Cipher.	FSE	2003	DBLP DOI BibTeX RDF
27	Paolo Arena, Adriano Basile, Luigi Fortuna, Mattia Frasca, Luca Patané	Implementation of Turing patterns for bio-inspired motion control.	ISCAS (3)	2003	DBLP DOI BibTeX RDF
27	Masanao Ozawa	Halting of Quantum Turing Machines.	UMC	2002	DBLP DOI BibTeX RDF
27	Jirí Wiedermann, Jan van Leeuwen	Emergence of a Super-Turing Computational Potential in Artificial Living Systems.	ECAL	2001	DBLP DOI BibTeX RDF
27	Lew Gordeev	Proof Theory and Post-turing Analysis.	Proof Theory in Computer Science	2001	DBLP DOI BibTeX RDF
27	Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu	On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations.	MCU	2001	DBLP DOI BibTeX RDF
27	Didier Caucal	On the Transition Graphs of Turing Machines.	MCU	2001	DBLP DOI BibTeX RDF
27	Christof Teuscher, Eduardo Sanchez	Self-Organizing Topology Evolution of Turing Neural Networks.	ICANN	2001	DBLP DOI BibTeX RDF
27	Jan van Leeuwen, Jirí Wiedermann	Beyond the Turing Limit: Evolving Interactive Systems.	SOFSEM	2001	DBLP DOI BibTeX RDF
27	Dina Q. Goldin	Persistent Turing Machines as a Model of Interactive Computation.	FoIKS	2000	DBLP DOI BibTeX RDF
27	Tomoyuki Yamakami	A Foundation of Programming a Multi-tape Quantum Turing Machine.	MFCS	1999	DBLP DOI BibTeX RDF
27	Levke Bentzien	Positive Turing and Truth-Table Completeness for NEXP Are Incomparable.	MFCS	1998	DBLP DOI BibTeX RDF
27	Maciej Liskiewicz, Rüdiger Reischuk	Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds.	MFCS	1997	DBLP DOI BibTeX RDF
27	Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel	RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness.	CIAC	1997	DBLP DOI BibTeX RDF
27	Hiroaki Yamamoto	Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines.	ICALP	1993	DBLP DOI BibTeX RDF
27	Matthias Krause 0001	Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time.	MFCS	1990	DBLP DOI BibTeX RDF
27	Walter J. Savitch, Paul M. B. Vitányi	Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps.	ICALP	1977	DBLP DOI BibTeX RDF
27	Michal Chytil	On Complexity of Nondeterministic Turing Machines Computations.	MFCS	1975	DBLP DOI BibTeX RDF
27	John E. Hopcroft, Jeffrey D. Ullman	Some Results on Tape-Bounded Turing Machines.	J. ACM	1969	DBLP DOI BibTeX RDF
27	Juris Hartmanis	Computational Complexity of One-Tape Turing Machine Computations.	J. ACM	1968	DBLP DOI BibTeX RDF
27	Michael A. Arbib	Turing Machines, Finite Automata and Neural Nets.	J. ACM	1961	DBLP DOI BibTeX RDF
26	Chung-Chih Li	Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Type-2 computation, Oracle Turing machine, Speed-up theorem
26	Sean W. Smith	Turing is from Mars, Shannon is from Venus: Computer Science and Computer Engineering.	IEEE Secur. Priv.	2005	DBLP DOI BibTeX RDF	computer science, computer engineering, Turing, Shannon
26	Anotida Madzvamuse, Philip K. Maini, Andrew J. Wathen	A Moving Grid Finite Element Method for the Simulation of Pattern Generation by Turing Models on Growing Domains.	J. Sci. Comput.	2005	DBLP DOI BibTeX RDF	Moving meshes, moving grid finite elements, Turing instability, reaction-diffusion systems
26	Yong Rui, Zicheng Liu 0001	ARTiFACIAL: automated reverse turing test using FACIAL features.	ACM Multimedia	2003	DBLP DOI BibTeX RDF	face and facial feature detection, web services security, CAPTCHA, turing test, human interactive proof (HIP)
26	Maciej Liskiewicz, Krzysztof Lorys	On Reversal Complexity for Alternating Turing Machines (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	reversal complexity, nonregular languages, ATM, space complexities, alternating Turing machines
24	Yehu Lv	Turing-Turing bifurcation in an activator-inhibitor system with gene expression time delay.	Commun. Nonlinear Sci. Numer. Simul.	2024	DBLP DOI BibTeX RDF
24	Lenny Pitt	Turing Tumble is Turing-Complete.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
24	Christian Dalvit, René Thiemann	A Verified Translation of Multitape Turing Machines into Singletape Turing Machines.	Arch. Formal Proofs	2022	DBLP BibTeX RDF