Search results for "Turing-computability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
63	Jérôme Durand-Lose	Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal.	CiE	2006	DBLP DOI BibTeX RDF	2-counter automata, Reversibility, Conservativeness, Turing-computability, Rational numbers, Abstract geometrical computation
54	Peter Koepke	Ordinal Computability.	CiE	2009	DBLP DOI BibTeX RDF	Ordinal machines, Infinite Time Register Machines, Constructible sets
53	Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky	Feedback Turing Computability, and Turing Computability as Feedback.	LICS	2015	DBLP DOI BibTeX RDF
48	Wilson Rosa de Oliveira, Marcílio Carlos Pereira de Souto, Teresa Bernarda Ludermir	Turing Machines with Finite Memory.	SBRN	2002	DBLP DOI BibTeX RDF
46	Lew Gordeev	Proof Theory and Post-turing Analysis.	Proof Theory in Computer Science	2001	DBLP DOI BibTeX RDF
44	Klaus Weihrauch, Ning Zhong 0002	Turing Computability of a Nonlinear Schrödinger Propagator.	COCOON	2001	DBLP DOI BibTeX RDF
41	Damir D. Dzhafarov	Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp.	Bull. Symb. Log.	2017	DBLP DOI BibTeX RDF
39	Klaus Weihrauch	A Foundation for Computable Analysis.	Foundations of Computer Science: Potential - Theory - Cognition	1997	DBLP DOI BibTeX RDF
36	Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap	Shortest path amidst disc obstacles is computable.	SCG	2005	DBLP DOI BibTeX RDF	disc obstacles, guaranteed precision computation, real RAM model, robust numerical algorithms, shortest path, exact geometric computation, exponential complexity
36	Peter Koepke	Computing a Model of Set Theory.	CiE	2005	DBLP DOI BibTeX RDF
30	Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez	Spiking neural P systems with extended rules: universality and languages.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Universality, Membrane computing, Turing computability, Spiking neural P systems, Chomsky hierarchy
30	Gheorghe Paun	A quick overview of membrane computing with some details about spiking neural P systems.	Frontiers Comput. Sci. China	2007	DBLP DOI BibTeX RDF	computational biology, membrane computing, P system, natural computing, Turing computability, spiking neural P system, chomsky hierarchy
30	Gheorghe Paun	Spiking Neural P Systems Used as Acceptors and Transducers.	CIAA	2007	DBLP DOI BibTeX RDF	string processing, membrane computing, Turing computability, spiking neural P system
30	Ioan I. Ardelean, Matteo Cavaliere, Dragos Sburlan	Computing using signals: from cells to P systems.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Cell Biology, L System, Membrane Computing, Turing Computability
30	Francesco Bernardini, Marian Gheorghe 0001	Cell communication in tissue P systems: universality results.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Tissue, Membrane computing, Turing computability
30	Linqiang Pan, Artiom Alhazov, Tseren-Onolt Ishdorj	Further remarks on P systems with active membranes, separation, merging, and release rules.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Membrane computing, Turing computability, SAT problem
30	Pierluigi Frisco	About P systems with symport/antiport.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Symport/Antiport, Counter automaton, Membrane computing, Turing computability
30	Shankara Narayanan Krishna, Gheorghe Paun	P Systems with Mobile Membranes.	Nat. Comput.	2005	DBLP DOI BibTeX RDF	matrix grammar, membrane computing, Turing computability
30	Francesco Bernardini, Marian Gheorghe 0001, Mike Holcombe	P X systems = P systems + X machines.	Nat. Comput.	2003	DBLP DOI BibTeX RDF	molecular computing, P systems, Turing computability, X machines
30	Rodica Ceterchi, Madhu Mutyam, Gheorghe Paun, K. G. Subramanian 0001	Array-rewriting P systems.	Nat. Comput.	2003	DBLP DOI BibTeX RDF	array languages, matrix grammar, membrane computing, P system, Turing computability
30	Mihai Ionescu, Carlos Martín-Vide, Andrei Paun, Gheorghe Paun	Unexpected universality results for three classes of P systems with symport/antiport.	Nat. Comput.	2003	DBLP DOI BibTeX RDF	membrane computing, P system, Turing computability, Chomsky hierarchy
26	Holger Boche, Rafael F. Schaefer, H. Vincent Poor	Identification Capacity of Channels With Feedback: Discontinuity Behavior, Super-Activation, and Turing Computability.	IEEE Trans. Inf. Theory	2020	DBLP DOI BibTeX RDF
26	Holger Boche, Ullrich J. Mönich	Turing Computability of Fourier Transforms of Bandlimited and Discrete Signals.	IEEE Trans. Signal Process.	2020	DBLP DOI BibTeX RDF
26	Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky	An introduction to feedback Turing computability.	J. Log. Comput.	2020	DBLP DOI BibTeX RDF
26	Holger Boche, Ullrich J. Mönich	Turing Computability of the Fourier Transform of Bandlimited Functions.	ISIT	2019	DBLP DOI BibTeX RDF
26	William I. Gasarch	Review of: Turing Computability: Theory and Applications by Robert Soare.	SIGACT News	2016	DBLP DOI BibTeX RDF
26	Alberto Ciaffaglione	Towards Turing computability via coinduction.	Sci. Comput. Program.	2016	DBLP DOI BibTeX RDF
26	Robert I. Soare	Turing Computability - Theory and Applications		2016	DOI RDF
26	Robert S. Lubarsky	Parallel Feedback Turing Computability.	LFCS	2016	DBLP DOI BibTeX RDF
26	Yurii Rogozhin, Artiom Alhazov	Turing Computability and Membrane Computing.	Int. Conf. on Membrane Computing	2012	DBLP DOI BibTeX RDF
26	Robert F. Hadley	Consistency, Turing Computability and Gödel's First Incompleteness Theorem.	Minds Mach.	2008	DBLP DOI BibTeX RDF
26	Bruce J. MacLennan	Transcending Turing Computability.	Minds Mach.	2003	DBLP DOI BibTeX RDF
26	Martin Ziegler 0001, Vasco Brattka	Turing computability of (non-)linear optimization.	CCCG	2001	DBLP BibTeX RDF
26	William J. Thomas	A simple generalization of Turing computability.	Notre Dame J. Formal Log.	1979	DBLP DOI BibTeX RDF
26	Ephraim P. Glinert	On Restricted Turing Computability.	Math. Syst. Theory	1971	DBLP DOI BibTeX RDF
18	Wilfried Sieg	Gödel's Conflicting Approaches to Effective Calculability.	CiE	2006	DBLP DOI BibTeX RDF
18	Klaus Weihrauch, Ning Zhong 0002	Is the Linear Schrödinger Propagator Turing Computable?	CCA	2000	DBLP DOI BibTeX RDF
18	Gösta Grahne, Matti Nykänen, Esko Ukkonen	Reasoning about Strings in Databases.	PODS	1994	DBLP DOI BibTeX RDF