Search results for "TURING"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Lenny Pitt	Turing Tumble is Turing-Complete.	CoRR	2021	DBLP BibTeX RDF
24	Feng Xia 0001, Jiaying Liu 0006, Jing Ren 0001, Wei Wang 0077, Xiangjie Kong 0001	Turing Number: How Far Are You to A. M. Turing Award?	CoRR	2021	DBLP BibTeX RDF
24	Tianrong Lin	Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine.	CoRR	2021	DBLP BibTeX RDF
24	Philip D. Welch	Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum-Shub-Smale machines.	Comput.	2021	DBLP DOI BibTeX RDF
24	Mengxin Chen, Ranchao Wu, Liping Chen	Spatiotemporal patterns induced by Turing and Turing-Hopf bifurcations in a predator-prey system.	Appl. Math. Comput.	2020	DBLP DOI BibTeX RDF
24	Feng Xia 0001, Jiaying Liu 0006, Jing Ren 0001, Wei Wang 0077, Xiangjie Kong 0001	Turing number: how far are you to A. M. Turing award?	SIGWEB Newsl.	2020	DBLP DOI BibTeX RDF
24	Paul M. B. Vitányi	Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
24	Jobst Landgrebe, Barry Smith 0001	There is no general AI: Why Turing machines cannot pass the Turing test.	CoRR	2019	DBLP BibTeX RDF
24	Paul M. B. Vitányi	Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines.	CoRR	2019	DBLP BibTeX RDF
24	Arnaud Ducrot, Xiaoming Fu 0003, Pierre Magal	Turing and Turing-Hopf Bifurcations for a Reaction Diffusion Equation with Nonlocal Advection.	J. Nonlinear Sci.	2018	DBLP DOI BibTeX RDF
24	Avelino J. Gonzalez, James Hollister, Ronald F. DeMara, Jason Leigh, Brandan Lanman, Sangyoon Lee, Shane T. Parker, Christopher Walls, Jeanne E. Parker, Josiah Wong, Clayton Barham, Bryan Wilder	AI in Informal Science Education: Bringing Turing Back to Life to Perform the Turing Test.	Int. J. Artif. Intell. Educ.	2017	DBLP DOI BibTeX RDF
24	Moshe Y. Vardi	Would Turing have won the Turing award?	Commun. ACM	2017	DBLP DOI BibTeX RDF
24	Thomas E. Woolley, Ruth E. Baker, Philip K. Maini	Turing's Theory of Morphogenesis: Where We Started, Where We Are and Where We Want to Go.	The Incomputable	2017	DBLP DOI BibTeX RDF
24	David H. Hamer	Review of Prof: Alan Turing Decoded by Dermot Turing.	Cryptologia	2016	DBLP DOI BibTeX RDF
24	Chris Christensen	Companion review of Prof: Alan Turing Decoded by Dermot Turing.	Cryptologia	2016	DBLP DOI BibTeX RDF
24	Eli Dresner, Ofra Rechter	From Symbol to 'Symbol', to Abstract Symbol: Response to Copeland and Shagrir on Turing-Machine Realism Versus Turing-Machine Purism.	Minds Mach.	2016	DBLP DOI BibTeX RDF
24	Alex Ushveridze	Can Turing machine be curious about its Turing test results? Three informal lectures on physics of intelligence.	CoRR	2016	DBLP BibTeX RDF
24	Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky	Feedback Turing Computability, and Turing Computability as Feedback.	LICS	2015	DBLP DOI BibTeX RDF
24	Moshe Y. Vardi	Would Turing have passed the Turing Test?	Commun. ACM	2014	DBLP DOI BibTeX RDF
24	Rod Downey (eds.)	Turing's Legacy: Developments from Turing's Ideas in Logic		2014	DBLP DOI BibTeX RDF
24	Matjaz Gams	Alan Turing, Turing Machines and Stronger.	Informatica (Slovenia)	2013	DBLP BibTeX RDF
24	Hector Zenil	Turing patterns with Turing machines: emergence and low-level structure formation.	Nat. Comput.	2013	DBLP DOI BibTeX RDF
24	Vasyl Ustimenko, Urszula Romanczuk	On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines.	Artificial Intelligence, Evolutionary Computing and Metaheuristics	2013	DBLP DOI BibTeX RDF
24	Kieran Greer	Turing: Then, Now and Still Key.	Artificial Intelligence, Evolutionary Computing and Metaheuristics	2013	DBLP DOI BibTeX RDF
24	Mark Burgin, Eugene Eberbach	Recursively Generated Evolutionary Turing Machines and Evolutionary Automata.	Artificial Intelligence, Evolutionary Computing and Metaheuristics	2013	DBLP DOI BibTeX RDF
24	Elena N. Benderskaya, Sofya V. Zhukova	Multidisciplinary Trends in Modern Artificial Intelligence: Turing's Way.	Artificial Intelligence, Evolutionary Computing and Metaheuristics	2013	DBLP DOI BibTeX RDF
24	Roman V. Yampolskiy	Turing Test as a Defining Feature of AI-Completeness.	Artificial Intelligence, Evolutionary Computing and Metaheuristics	2013	DBLP DOI BibTeX RDF
24	Richard J. Lipton	Might Turing Have Won a Turing Award?	Computer	2012	DBLP DOI BibTeX RDF
24	Hector Zenil	Turing Patterns with Turing Machines: Emergence and Low-level Structure Formation	CoRR	2012	DBLP BibTeX RDF
24	Emmanuel Jeandel	On Immortal Configurations in Turing Machines.	CiE	2012	DBLP DOI BibTeX RDF
24	Jean Lassègue, Giuseppe Longo	What is Turing's Comparison between Mechanism and Writing Worth?	CiE	2012	DBLP DOI BibTeX RDF
24	Juris Hartmanis	Turing Machine-Inspired Computer Science Results.	CiE	2012	DBLP DOI BibTeX RDF
24	David Fernández-Duque, Joost J. Joosten	Turing Progressions and Their Well-Orders.	CiE	2012	DBLP DOI BibTeX RDF
24	Víctor A. Ocasio-González	Turing Computable Embeddings and Coding Families of Sets.	CiE	2012	DBLP DOI BibTeX RDF
24	James D. Murray 0001	After Turing: Mathematical Modelling in the Biomedical and Social Sciences - From Animal Coat Patterns to Brain Tumours to Saving Marriages.	CiE	2012	DBLP DOI BibTeX RDF
24	Shigeru Kondo	Turing Pattern Formation without Diffusion.	CiE	2012	DBLP DOI BibTeX RDF
24	Susan G. Sterrett	Bringing Up Turing's 'Child-Machine'.	CiE	2012	DBLP DOI BibTeX RDF
24	Lorenzo Carlucci, Konrad Zdanowski	A Note on Ramsey Theorems and Turing Jumps.	CiE	2012	DBLP DOI BibTeX RDF
24	Verónica Becher	Turing's Normal Numbers: Towards Randomness.	CiE	2012	DBLP DOI BibTeX RDF
24	Matthew P. Szudzik	Is Turing's Thesis the Consequence of a More General Physical Principle?	CiE	2012	DBLP DOI BibTeX RDF
24	Jonathan A. Sherratt	Turing Patterns in Deserts.	CiE	2012	DBLP DOI BibTeX RDF
24	Paul W. Rendell	A Simple Universal Turing Machine for the Game of Life Turing Machine.	J. Cell. Autom.	2011	DBLP BibTeX RDF
24	Selmer Bringsjord	God, souls, and Turing: in defense of the theological objection to the Turing test.	Kybernetes	2010	DBLP DOI BibTeX RDF
24	Tsunehiro Yoshinaga, Jianliang Xu, Makoto Sakamoto	Non-closure Properties of 1-Inkdot Nondeterministic Turing Machines and Alternating Turing Machines with Only Universal States Using Small Space.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2010	DBLP DOI BibTeX RDF
24	Paul W. Rendell	A Simple Universal Turing Machine for the Game of Life Turing Machine.	Game of Life Cellular Automata	2010	DBLP DOI BibTeX RDF
24	Mark Burgin, Eugene Eberbach	Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms.	Fundam. Informaticae	2009	DBLP DOI BibTeX RDF
24	E. H. Flach, Santiago Schnell, John Norbury	Turing pattern outside of the Turing domain.	Appl. Math. Lett.	2007	DBLP DOI BibTeX RDF
24	Jirí Wiedermann	Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines.	Theor. Comput. Sci.	2004	DBLP DOI BibTeX RDF
24	Géza Harváth, Katsushi Inoue, Akira Ito, Yue Wang 0002	Closure Property of Probabilistic Turing Machines and Alternating Turing Machines with Sublogarithmic Spaces.	Int. J. Found. Comput. Sci.	2001	DBLP DOI BibTeX RDF
24	B. Jack Copeland, Diane Proudfoot	What Turing Did after He Invented the Universal Turing Machine.	J. Log. Lang. Inf.	2000	DBLP DOI BibTeX RDF
24	Katsushi Inoue, Akira Ito, Itsuo Takanami	A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space.	Inf. Process. Lett.	1992	DBLP DOI BibTeX RDF
24	Armin Hemmerling	Turing-Automaten, Systeme von Turing-Automaten und Zellularräume in mehrdimensionalen Speichermedien.		1979	RDF
23	Miklós Ajtai	Oblivious RAMs without cryptogrpahic assumptions.	STOC	2010	DBLP DOI BibTeX RDF	RAM, oblivious
23	Hajnal Andréka, István Németi, Péter Németi	General relativistic hypercomputing and foundation of mathematics.	Nat. Comput.	2009	DBLP DOI BibTeX RDF	Relativistic computation, Hypercomputation, Church-Thuring barrier, General relativity theory, Kerr-Newman spacetimes, Church Thesis, Blue-shift problem, Evaporation of black holes, Supertasks, Malament-Hogarth spacetime, Hilbert programme, Foundations of mathematics, Black holes, Cosmology
23	Andrea Sorbi, Guohua Wu, Yue Yang 0004	High Minimal Pairs in the Enumeration Degrees.	TAMC	2009	DBLP DOI BibTeX RDF
23	Benjamin Wells	Advances in I/O, Speedup, and Universality on Colossus, an Unconventional Computer.	UC	2009	DBLP DOI BibTeX RDF	universal computation, small UTM, preclassical computers, Colossus
23	Peter Koepke	Ordinal Computability.	CiE	2009	DBLP DOI BibTeX RDF	Ordinal machines, Infinite Time Register Machines, Constructible sets
23	David Doty	Dimension Extractors and Optimal Decompression.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Compression, Kolmogorov complexity, Dimension, Extractor, Martingale, Algorithmic randomness
23	M. Sakthi Balan, Helmut Jürgensen	On the universality of peptide computing.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Peptide computing, DNA computing, Molecular computing, Unconventional computing
23	Johanna N. Y. Franklin	Schnorr trivial reals: a construction.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematical Subject Classification (2000) 03D15
23	Edwin J. Beggs, José Félix Costa, Bruno Loff, John V. Tucker	On the Complexity of Measurement in Classical Physics.	TAMC	2008	DBLP DOI BibTeX RDF
23	Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie	Linear Recursive Functions.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF	linear calculi, computable functions, iteration, Recursion theory
23	Antoine Meyer	Traces of Term-Automatic Graphs.	MFCS	2007	DBLP DOI BibTeX RDF
23	Hongxia Shen, Zhen Jin 0001	Two dimensional pattern formation of prey-predator system.	SNPD (2)	2007	DBLP DOI BibTeX RDF
23	Holger Spakowski, Rahul Tripathi	Hierarchical Unambiguity.	MFCS	2006	DBLP DOI BibTeX RDF
23	Jerzy Mycka, Francisco Coelho, José Félix Costa	The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem.	UC	2006	DBLP DOI BibTeX RDF
23	M. Sakthi Balan, Helmut Jürgensen	Peptide Computing - Universality and Theoretical Model.	UC	2006	DBLP DOI BibTeX RDF
23	S. Barry Cooper	How Can Nature Help Us Compute?	SOFSEM	2006	DBLP DOI BibTeX RDF
23	Graham P. Oliver, Richard M. Thomas	Automatic Presentations for Finitely Generated Groups.	STACS	2005	DBLP DOI BibTeX RDF
23	Lars Kristiansen, Mathias Barra	The Small Grzegorczyk Classes and the Typed lambda-Calculus.	CiE	2005	DBLP DOI BibTeX RDF
23	Vasco Brattka, Matthias Schröder 0001	Computing with Sequences, Weak Topologies and the Axiom of Choice.	CSL	2005	DBLP DOI BibTeX RDF
23	Priya Baliga, T. Y. Lin	Kolmogorov complexity based automata modeling for intrusion detection.	GrC	2005	DBLP DOI BibTeX RDF
23	Newton Lee	A word from the editor.	Comput. Entertain.	2004	DBLP DOI BibTeX RDF
23	W. Paul Cockshott	Array languages and the challenge of modern computer architecture.	ACM SIGAPL APL Quote Quad	2004	DBLP DOI BibTeX RDF
23	Peng Yin 0003, Andrew J. Turberfield, Sudheer Sahu, John H. Reif	Design of an Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion.	DNA	2004	DBLP DOI BibTeX RDF
23	Luis Antunes 0002, Lance Fortnow, N. V. Vinodchandran	Using Depth to Capture Average-Case Complexity.	FCT	2003	DBLP DOI BibTeX RDF
23	Frank Stephan 0001	On one-sided versus two-sided classification.	Arch. Math. Log.	2001	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03D28, 68T05, 03D30
23	Peter A. Fejer, Richard A. Shore	Every incomplete computably enumerable truth-table degree is branching.	Arch. Math. Log.	2001	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03D30, 03D25
23	Leslie G. Valiant	Quantum computers that can be simulated classically in polynomial time.	STOC	2001	DBLP DOI BibTeX RDF
23	Aggelos Kiayias, Aris Pagourtzis, Kiron Sharma, Stathis Zachos	Acceptor-Definable Counting Classes.	Panhellenic Conference on Informatics	2001	DBLP DOI BibTeX RDF
23	Amir M. Ben-Amram, Neil D. Jones	Computational complexity via programming languages: constant factors do matter.	Acta Informatica	2000	DBLP DOI BibTeX RDF
23	Umesh V. Vazirani	Fourier Transforms and Quantum Computation.	Theoretical Aspects of Computer Science	2000	DBLP DOI BibTeX RDF
23	Holger Petersen 0001, John Michael Robson	Efficient Simulations by Queue Machines.	ICALP	1998	DBLP DOI BibTeX RDF
23	Oded Goldreich 0001, Rafail Ostrovsky	Software Protection and Simulation on Oblivious RAMs.	J. ACM	1996	DBLP DOI BibTeX RDF	simulation of random access machines, software protection, pseudorandom functions
23	Rusins Freivalds, Marek Karpinski	Lower Space Bounds for Randomized Computation.	ICALP	1994	DBLP DOI BibTeX RDF
23	Ioan I. Macarie	Space-Efficient Deterministic Simulation of Probabilistic Automata (Extended Abstract).	STACS	1994	DBLP DOI BibTeX RDF
23	Martin Schmidt 0007	On the Power of Several Queues.	STACS	1991	DBLP DOI BibTeX RDF
23	Harry G. Mairson	Deciding ML Typability is Complete for Deterministic Exponential Time.	POPL	1990	DBLP DOI BibTeX RDF	ML
23	Yuri Gurevich, Saharon Shelah	Nearly Linear Time.	Logic at Botik	1989	DBLP DOI BibTeX RDF
23	Klaus Ambos-Spies	On the Structure of Polynomial Time Degrees.	STACS	1984	DBLP DOI BibTeX RDF
23	Petr Hájek 0001	Arithmetical Complexity of Some Problems in Computer Science.	MFCS	1977	DBLP DOI BibTeX RDF
23	Arnold L. Rosenberg	On the Independence of Real-Time Definability and Certain Structural Properties of Context-Free Languages.	J. ACM	1968	DBLP DOI BibTeX RDF
22	Stephen A. Fenner, William I. Gasarch, Brian Postow	The Complexity of Finding SUBSEQ(A).	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Turing degree, Higman’s lemma, Unbounded search, Recursive mathematics, Computational complexity, Computability, Context-free grammar, Automata theory, Automaton, Context-free language, Subsequence, Reverse mathematics, Bounded queries
22	Mark Hogarth	A new problem for rule following.	Nat. Comput.	2009	DBLP DOI BibTeX RDF	Wittgenstein, Non-Turing computing, Malament-Hogarth spacetime, Algorithm
22	Ravi V. Gomatam	Quantum Theory, the Chinese Room Argument and the Symbol Grounding Problem.	QI	2009	DBLP DOI BibTeX RDF	Chinese Room Argument, Symbol Grounding Problem, Sanskrit Room Argument, Universal Turing Machine, Exotic manifolds, Artificial Intelligence, Topology, Quantum theory
22	B. J. Smith, Harry S. Delugach	Another Reason Why Conceptual Graphs Need Actors.	ICCS	2009	DBLP DOI BibTeX RDF	context, sequence, iteration, actors, conceptual graphs, Turing machine, alternative, non-monotonic logic
22	Jérôme Durand-Lose	Abstract Geometrical Computation and Computable Analysis.	UC	2009	DBLP DOI BibTeX RDF	Signal machine, Type-2 Turing machine, Computable analysis, Analog computation, Abstract geometrical computation
22	John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran	Partial Bi-immunity, Scaled Dimension, and NP-Completeness.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Many-one completeness, Bi-immunity, Scaled dimension, Turing completeness
22	William B. Langdon, Riccardo Poli	Mapping non-conventional extensions of genetic programming.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Markov analysis of program search spaces, Any time computation, Entropy and irreversible loss of information, Program convergence, Halting probability genetic algorithms, Genetic programming, Turing complete, Program termination
22	Mohammad Shirali-Shahreza, Sajad Shirali-Shahreza	A CAPTCHA system for Nintendo DS.	NETGAMES	2008	DBLP DOI BibTeX RDF	CAPTCHA (completely automated public turing test to tell computers and human apart), Nintendo DS, game consoles