Search results for "TURING"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Liang Xie 0002, Hui Song, Trent Jaeger, Sencun Zhu	A systematic approach for cell-phone worm containment.	WWW	2008	DBLP DOI BibTeX RDF	cell phone, patch, turing test
22	Mohammad Shirali-Shahreza, Sajad Shirali-Shahreza	Advanced Collage CAPTCHA.	ITNG	2008	DBLP DOI BibTeX RDF	CAPTCHA (Completely Automated Public Turing test to tell Computers and Human Apart), Collage CAPTCHA, Non-OCR-Based CAPTCHA
22	Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück	Principles of a reversible programming language.	Conf. Computing Frontiers	2008	DBLP DOI BibTeX RDF	backward determinism, inverse semantics, fast fourier transform, reversible computing, turing completeness
22	Jozef Gruska	A broader view on the limitations of information processing and communication by nature.	Nat. Comput.	2007	DBLP DOI BibTeX RDF	Frontiers and barriers of information processing, Information processing by nature, Quantum information processing, Church-Turing barrier, Security, Feasibility
22	Dariusz Kusmierek	The Inhabitation Problem for Rank Two Intersection Types.	TLCA	2007	DBLP DOI BibTeX RDF	type inhabitation problem, lambda calculus, intersection types, alternating Turing machine
22	Tommaso Bolognesi	Planar Trivalent Network Computation.	MCU	2007	DBLP DOI BibTeX RDF	Digital physics, trivalent network, complexity indicator, two-dimensional Turing machine, turmite, emergent space, cellular automata
22	Laura Korte, Stuart Anderson, Helen Pain, Judith Good	Learning by game-building: a novel approach to theoretical computer science education.	ITiCSE	2007	DBLP DOI BibTeX RDF	game-building, game-based learning, automata theory, turing machines, regular languages, constructionism, theoretical computer science
22	Zhimin Yuan, Zhiguo Zhang	Asynchronous Spiking Neural P System with Promoters.	APPT	2007	DBLP DOI BibTeX RDF	Asynchronous P System, Parallel Computing, Membrane Computing, Molecular Computing, P System, Turing Complete
22	Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati	On the Complexity of Unary Tiling-Recognizable Picture Languages.	STACS	2007	DBLP DOI BibTeX RDF	unary picture languages, tiling systems, Turing machine head reversal
22	Giangiacomo Gerla	Multi-valued Logics, Effectiveness and Domains.	CiE	2007	DBLP DOI BibTeX RDF	Fuzzy grammar, Fuzzy Turing Machine, Church Thesis, Fuzzy logic, Computability, Multi-valued logic, Domain theory
22	Jennifer Burg, Karola Luttringhaus	Entertaining with science, educating with dance.	Comput. Entertain.	2006	DBLP DOI BibTeX RDF	multimedia, parallel computation, Digital media, Turing machine, real-time computation
22	Raúl Rojas 0001	Reviews.	IEEE Ann. Hist. Comput.	2005	DBLP DOI BibTeX RDF	Arthur Porter, I. Bernard Cohen, Turing Test
22	Philippe Golle, Nicolas Ducheneaut	Preventing bots from playing online games.	Comput. Entertain.	2005	DBLP DOI BibTeX RDF	reverse Turing test, agents, games, CAPTCHAs, bots
22	Verónica Becher, Santiago Figueira	Kolmogorov Complexity for Possibly Infinite Computations.	J. Log. Lang. Inf.	2005	DBLP DOI BibTeX RDF	infinite computations, monotone machines, non-effective computations, program-size complexity, Kolmogorov complexity, Turing machines
22	Shankara Narayanan Krishna, Gheorghe Paun	P Systems with Mobile Membranes.	Nat. Comput.	2005	DBLP DOI BibTeX RDF	matrix grammar, membrane computing, Turing computability
22	B. Jack Copeland	Colossus: Its Origins and Originators.	IEEE Ann. Hist. Comput.	2004	DBLP DOI BibTeX RDF	Newman, Tutte, Bletchley Park, Lorenz Sz40/42, Tunny, Heath Robinson, First Electronic Computer, Turingery, Statistical Method, Turing, Differencing, Flowers, Colossus
22	Astrid Glende	Agent design to pass computer games.	ACM Southeast Regional Conference	2004	DBLP DOI BibTeX RDF	artificial intelligence, computer games, Turing Test, believable agents, agent design
22	Ryan Cavalcante, Thomas Finley, Susan H. Rodger	A visual and interactive automata theory course with JFLAP 4.0.	SIGCSE	2004	DBLP DOI BibTeX RDF	SLR parsing, automata, grammar, L-system, turing machine, pushdown automata, JFLAP, LL parsing
22	Dana Angluin, Martins Krikis	Learning from Different Teachers.	Mach. Learn.	2003	DBLP DOI BibTeX RDF	programming system, oracle Turing machine, concept learning, teacher, hint, complexity bound
22	Henry S. Baird, Kris Popat	Human Interactive Proofs and Document Image Analysis.	Document Analysis Systems	2002	DBLP DOI BibTeX RDF	abuse of web sites and services, the chatroom problem, human/machine discrimination, OCR performance evaluation, legibility of text, document image analysis, CAPTCHAs, Turing tests, Human interactive proofs, document image degradations
22	Marian Gheorghe 0001	Generalised Stream X-Machines and Cooperating Distributed Grammar Systems.	Formal Aspects Comput.	2000	DBLP DOI BibTeX RDF	Cooperating distributed grammar systems, Generalised stream X-machines, Computational models, Turing machines, Formal grammars
22	Andrei A. Muchnik, Andrei E. Romashchenko, Alexander Shen, Nikolai K. Vereshchagin	Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y".	CCC	1999	DBLP DOI BibTeX RDF	Turing degrees, mutual information, Kolmogorov complexity
22	Rodney G. Downey, André Nies	Undecidability Results for Low Complexity Degree Structures.	CCC	1997	DBLP DOI BibTeX RDF	undecidability results, low complexity degree structures, EXPTIME degrees, polynomial time Turing, many-one reducibility, coding method, ideal lattices, hyper-polynomial time classes, Boolean algebra, Boolean algebras
22	John H. Reif, Micha Sharir	Motion Planning in the Presence of Moving Obstacles.	J. ACM	1994	DBLP DOI BibTeX RDF	moving obstacles, theory of reals, computational geometry, motion planning, decision procedures, Turing machines, cylindrical algebraic decomposition
22	James R. Cordy, Nicholas L. Eliot, Michael G. Robertson	TuringTool: A User Interface to Aid in the Software Maintenance Task.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	software maintenance task, source program, editing system, TuringTool, single comprehensive viewing paradigm, source text elision, large source programs, structural views, nonstructural views, dynamic creation, complex programmer-specified views, simple set theoretic operators, Turing programming language, seamless viewing, separately compiled source modules, uniform source, software engineering, user interface, user interfaces, programming environments, high level languages, program development environments
22	Tao Jiang 0001	On the Complexity of (Off-Line) 1-Tape ATM's Running in Constant Reversals.	ICCI	1990	DBLP DOI BibTeX RDF	1-tape, off-line 1-tape, head reversal, computational complexity, alternating Turing machine
22	Donald A. Varvel, Leonard D. Shapiro	The Computational Completeness of Extended Database Query Languages.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	computational completeness, extended database query languages, POSTGRES, GENESIS, Turing machine interpreter, traditional database languages, programming language, database management systems, query languages, computational power
19		Liskov wins Turing award.	Commun. ACM	2009	DBLP DOI BibTeX RDF
19	Tomoyuki Yamakami	The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract).	ISAAC	2009	DBLP DOI BibTeX RDF
19	Stefan Artmann	Behavioural Congruence in Turing Test-Like Human-Computer Interaction.	KI	2009	DBLP DOI BibTeX RDF
19	Fabio Musso, Giovanni Feverati	A Proposal for an Optimal Mutation Probability in an Evolutionary Model Based on Turing Machines.	IDEAL	2009	DBLP DOI BibTeX RDF
19	Bogdan Aman, Gabriel Ciobanu	Turing Completeness Using Three Mobile Membranes.	UC	2009	DBLP DOI BibTeX RDF
19	Samuel Coskey	Infinite-Time Turing Machines and Borel Reducibility.	CiE	2009	DBLP DOI BibTeX RDF
19	Michael Stonebraker	Why did Jim Gray win the Turing Award?	SIGMOD Rec.	2008	DBLP DOI BibTeX RDF
19	Markus Mueller	Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
19	Yongming Li 0001	Fuzzy Turing Machines: Variants and Universality.	IEEE Trans. Fuzzy Syst.	2008	DBLP DOI BibTeX RDF
19	César Ignacio García-Osorio, Iñigo Mediavilla-Sáiz, Javier Jimeno-Visitación, Nicolás García-Pedrajas	Teaching push-down automata and turing machines.	ITiCSE	2008	DBLP DOI BibTeX RDF	chomsky normal form, cocke-younger-kasami algorithm, interactive teaching tool, regular expression, grammar, finite automaton, ll parsing
19	Harald Hempel, Madlen Kimmritz	Persistent Computations of Turing Machines.	CIAA	2008	DBLP DOI BibTeX RDF
19	Petrus H. Potgieter, Elemér E. Rosinger	Ultrafilter and Non-standard Turing Machines.	UC	2008	DBLP DOI BibTeX RDF
19	Lars Kristiansen	Recursion in Higher Types and Resource Bounded Turing Machines.	CiE	2008	DBLP DOI BibTeX RDF
19	Heather Barber, Daniel Kudenko	Generation of Dilemma-Based Narratives: Method and Turing Test Evaluation.	ICIDS	2008	DBLP DOI BibTeX RDF
19	Holger Petersen 0001	Element Distinctness and Sorting on One-Tape Off-Line Turing Machines.	SOFSEM	2008	DBLP DOI BibTeX RDF
19	Philip D. Welch	Turing Unbound: Transfinite Computation.	CiE	2007	DBLP DOI BibTeX RDF
19	Ralf Küsters	Simulation-Based Security with Inexhaustible Interactive Turing Machines.	CSFW	2006	DBLP DOI BibTeX RDF
19	Joël Ouaknine, James Worrell 0001	On Metric Temporal Logic and Faulty Turing Machines.	FoSSaCS	2006	DBLP DOI BibTeX RDF
19	H. Ramesh 0001, Shankara Narayanan Krishna, Raghavan Rama 0001	On the Power of Bio-Turing Machines.	UC	2006	DBLP DOI BibTeX RDF
19	Philip D. Welch	Non-deterministic Halting Times for Hamkins-Kidder Turing Machines.	CiE	2006	DBLP DOI BibTeX RDF
19	István Németi, Hajnal Andréka	Can General Relativistic Computers Break the Turing Barrier?.	CiE	2006	DBLP DOI BibTeX RDF
19	Isaiah Pinchas Kantorovitz	A note on turing machine computability of rule driven systems.	SIGACT News	2005	DBLP DOI BibTeX RDF	rule driven systems theory
19	Amir M. Ben-Amram	The Church-Turing thesis and its look-alikes.	SIGACT News	2005	DBLP DOI BibTeX RDF
19	Stephen Chen, Stephen Morris	Iconic programming for flowcharts, java, turing, etc.	ITiCSE	2005	DBLP DOI BibTeX RDF	high school programming, CS1, visualization tools, non-majors, CS0
19	Yinfeng Wang, Xiaoshe Dong, Hua Guo, Xiuqiang He 0001, GuoRong Liu	A Constellation Resource Discovery Model Based on Scalable Multi-tape Universal Turing Machine.	GCC	2005	DBLP DOI BibTeX RDF
19	Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu	Robust Simulations of Turing Machines with Analytic Maps and Flows.	CiE	2005	DBLP DOI BibTeX RDF
19	Joel David Hamkins	Infinitary Computability with Infinite Time Turing Machines.	CiE	2005	DBLP DOI BibTeX RDF
19	Giuseppe Trautteur	Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality.	CiE	2005	DBLP DOI BibTeX RDF
19	W. Joseph MacInnes	Believability in multi-agent computer games: revisiting the turing test.	CHI Extended Abstracts	2004	DBLP DOI BibTeX RDF
19	Amir M. Ben-Amram, Omer Berkman, Holger Petersen 0001	Element distinctness on one-tape Turing machines: a complete solution.	Acta Informatica	2003	DBLP DOI BibTeX RDF
19	Andrew Chi-Chih Yao	Classical physics and the Church-Turing Thesis.	J. ACM	2003	DBLP DOI BibTeX RDF
19	Victor L. Selivanov	Wadge Degrees of omega-Languages of Deterministic Turing Machines.	STACS	2003	DBLP DOI BibTeX RDF	Wadge degree, $omega$-language, Cantor space, set-theoretic operation, hierarchy, reducibility
19	Tsz-Yan Chan	Using a Text-to-Speech Synthesizer to Generate a Reverse Turing Test.	ICTAI	2003	DBLP DOI BibTeX RDF
19	Claudio Baiocchi	Three Small Universal Turing Machines.	MCU	2001	DBLP DOI BibTeX RDF
19	Manfred Kudlek, Yurii Rogozhin	A Universal Turing Machine with 3 States and 9 Symbols.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF
19	Klaus Weihrauch, Ning Zhong 0002	Turing Computability of a Nonlinear Schrödinger Propagator.	COCOON	2001	DBLP DOI BibTeX RDF
19	Shamil Ishmukhametov	On relative enumerability of Turing degrees.	Arch. Math. Log.	2000	DBLP DOI BibTeX RDF
19	Klaus Weihrauch, Ning Zhong 0002	Is the Linear Schrödinger Propagator Turing Computable?	CCA	2000	DBLP DOI BibTeX RDF
19	Klaus Weihrauch, Ning Zhong 0002	The Wave Propagator Is Turing Computable.	ICALP	1999	DBLP DOI BibTeX RDF
19	Matthew B. Robinson, Jason A. Hamshar, Jorge E. Novillo, Andrew T. Duchowski	A Java-based tool for reasoning about models of computation through simulating finite automata and Turing machines.	SIGCSE	1999	DBLP DOI BibTeX RDF
19	Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick	A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.	STACS	1999	DBLP DOI BibTeX RDF
19	João Pedro Guerreiro Neto, Hava T. Siegelmann, José Félix Costa, Carmen Paz Suárez Araujo	Turing Universality of Neural Nets (Revisited).	EUROCAST	1997	DBLP DOI BibTeX RDF	recursive function theory, modularity, Neural computation
19	Rainer Schuler	Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP.	CCC	1996	DBLP DOI BibTeX RDF	computational complexity, completeness, average-case analysis, resource-bounded measure
19	Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini	Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages.	MFCS	1995	DBLP DOI BibTeX RDF
19	A. C. Manoharan, M. Manoharan	Beyond Turing: A Knowledge Based Model Relativistic Cn Machine.	ACM Conference on Computer Science	1992	DBLP DOI BibTeX RDF
19	Janis Kaneps, Rusins Freivalds	Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines.	MFCS	1990	DBLP DOI BibTeX RDF
19	Karol Habart	Randomness and Turing Reducibility Restraints.	CSL	1990	DBLP DOI BibTeX RDF
19	Richard C. Holt	Device Management in TURING PLUS.	ACM SIGOPS Oper. Syst. Rev.	1988	DBLP DOI BibTeX RDF	Pascal
19	Martin Dietzfelbinger, Wolfgang Maass 0001	The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape.	ICALP	1988	DBLP DOI BibTeX RDF
19	Akira Ito, Katsushi Inoue, Itsuo Takanami	The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines.	IMYCS	1988	DBLP DOI BibTeX RDF
19	Thomas Gundermann, Gerd Wechsung	Nondeterministic Turing Machines with Modified Acceptance.	MFCS	1986	DBLP DOI BibTeX RDF
19	Richard M. Karp	Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines.	J. ACM	1967	DBLP DOI BibTeX RDF
19	F. C. Hennie, Richard Edwin Stearns	Two-Tape Simulation of Multitape Turing Machines.	J. ACM	1966	DBLP DOI BibTeX RDF
15		To change the world, take a chance.	Commun. ACM	2011	DBLP DOI BibTeX RDF
15		UX design and agile: a natural fit? (Talking with Julian Gosper, Jean-Luc Agathos, Richard Rutter, and Terry Coatta).	Commun. ACM	2011	DBLP DOI BibTeX RDF
15		In the Virtual Extension.	Commun. ACM	2011	DBLP DOI BibTeX RDF
15	Robert Law	Using student blogs for documentation in software development projects.	ITiCSE	2011	DBLP DOI BibTeX RDF
15	Giorgi Japaridze	Many Concepts and Two Logics of Algorithmic Reduction.	Stud Logica	2009	DBLP DOI BibTeX RDF	Affine logic, Interactivecomputation, Linear logic, Game semantics, Intuitionistic logic, Computability logic
15	Mike Stannett	The computational status of physics.	Nat. Comput.	2009	DBLP DOI BibTeX RDF	Hypercomputation, Arrow of time, Theory of computation, Natural computation, Discrete time, Quantum theory, Philosophy of science
15	Ugo Dal Lago, Simone Martini 0001	On Constructor Rewrite Systems and the Lambda-Calculus.	ICALP (2)	2009	DBLP DOI BibTeX RDF
15	Paolo Bottoni, Anna Labella, Florin Manea, Victor Mitrana, José M. Sempere	Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof.	DNA	2009	DBLP DOI BibTeX RDF
15	Abuzer Yakaryilmaz, A. C. Cem Say	Languages Recognized with Unbounded Error by Quantum Finite Automata.	CSR	2009	DBLP DOI BibTeX RDF
15	Riccardo Poli, William B. Langdon	Genetic programming theory I & II.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	genetic programming, Markov chains, schema theory
15	Edwin J. Beggs	Using Physical Experiments as Oracles.	UC	2009	DBLP DOI BibTeX RDF
15	Andrey N. Frolov, Iskander Sh. Kalimullin, Russell G. Miller	Spectra of Algebraic Fields and Subfields.	CiE	2009	DBLP DOI BibTeX RDF	Computability, algebraic, field, spectrum, computable model theory
15	Larry Bull, Richard Preen	On Dynamical Genetic Programming: Random Boolean Networks in Learning Classifier Systems.	EuroGP	2009	DBLP DOI BibTeX RDF
15	Olivier Finkel	Wadge Degrees of Infinitary Rational Relations.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	2-tape Büchi automata, infinitary rational relations, Cantor topology, topological complexity, Wadge hierarchy, Wadge degrees, Wadge games, Borel hierarchy, complete sets
15	S. Barry Cooper, Angsheng Li	On Lachlan's major sub-degree problem.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) Primary 03D25, Secondary 03D35, 03D30
15	Manuel Lameiras Campagnolo, Kerry Ojakian	The elementary computable functions over the real numbers: applying two new techniques.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q15
15	Shingo Ibuka, Makoto Kikuchi, Hirotaka Kikyo	On Characteristic Constants of Theories Defined by Kolmogorov Complexity.	WoLLIC	2008	DBLP DOI BibTeX RDF
15	Lotfi A. Zadeh	Toward human level machine intelligence - is it achievable?	IEEE ICCI	2008	DBLP DOI BibTeX RDF
15	Benny Applebaum, Boaz Barak, David Xiao	On Basing Lower-Bounds for Learning on Worst-Case Assumptions.	FOCS	2008	DBLP DOI BibTeX RDF
15	Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück	Reversible Flowchart Languages and the Structured Reversible Program Theorem.	ICALP (2)	2008	DBLP DOI BibTeX RDF