| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Barbara F. Csima |
Comparing C.E. Sets Based on Their Settling Times.  |
CiE  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Rettinger |
Computable Riemann Surfaces. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
computable Riemann surface, computable uniformization |
| 1 | Michael R. Fellows, Frances A. Rosamond |
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasco Brattka, Guido Gherardi |
Borel Complexity of Topological Operations on Computable Metric Spaces. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
effective descriptive set theory, Borel measurability, hyperspace topologies, Computable analysis |
| 1 | Gregorio de Miguel Casado, Juan Manuel García Chamizo, María Teresa Signes Pont |
Algebraic Model of an Arithmetic Unit for TTE-Computable Normalized Rational Numbers. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
formal methods for VLSI design, Type-2 Theory of Effectivity, online arithmetic |
| 1 | Leszek Aleksander Kolodziejczyk, Neil Thapen |
The Polynomial and Linear Hierarchies in V0. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
prefix parity, linear hierarchy, bounded depth circuits, bounded arithmetic |
| 1 | Christopher G. Timpson |
What Is the Lesson of Quantum Computing? |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Busi, Claudio Zandron |
Computing with Genetic Gates. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rongfang Bie, Guohua Wu |
A Minimal Pair in the Quotient Structure M / NCup. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Computably enumerable degrees, quotient structure, minimal pairs |
| 1 | Francesco Bernardini, Marian Gheorghe 0001, Maurice Margenstern, Sergey Verlan |
Producer/Consumer in Membrane Systems and Petri Nets. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Damien Woods, Turlough Neary |
The Complexity of Small Universal Turing Machines. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Ziegler 0001 |
(Short) Survey of Real Hypercomputation. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luigi Acerbi, Alberto Dennunzio, Enrico Formenti |
Shifting and Lifting of Cellular Automata. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
topological dynamics, deterministic chaos, cellular automata, discrete time dynamical systems |
| 1 | S. Barry Cooper, Benedikt Löwe, Andrea Sorbi (eds.) |
Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
| 1 | Iskander Sh. Kalimullin |
Some Notes on Degree Spectra of the Structures. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ying Gao, Jingde Cheng |
Operational Semantics for Positive Relevant Logics Without Distribution. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Operational semantics, Relevant logics |
| 1 | David Doty, Philippe Moser |
Feasible Depth. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
randomness, polynomial-time, dimension, depth, finite-state |
| 1 | Hajime Ishihara |
Unique Existence and Computability in Constructive Reverse Mathematics. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
unique existence, Brouwer’s fan theorem, weak König lemma, computability, constructive mathematics, reverse mathematics |
| 1 | James Ladyman |
Physics and Computation: The Status of Landauer's Principle. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion |
A Classification of Viruses Through Recursion Theorems. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
iteration theorem, polymorphism, propagation, Computer viruses, recursion theorem |
| 1 | Grzegorz Rozenberg |
Natural Computing: A Natural and Timely Trend for Natural Sciences and Science of Computation. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gyesik Lee |
Binary Trees and (Maximal) Order Types. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Gori, Klaus Meer |
Some Aspects of a Complexity Theory for Continuous Time Systems. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Schuster 0001 |
Problems as Solutions. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
uniform continuity, unique existence, countable choice, completeness, Metric spaces, constructive mathematics |
| 1 | Laurent Bienvenu, David Doty, Frank Stephan 0001 |
Constructive Dimension and Weak Truth-Table Degrees. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
weak truth-table, randomness, extractor, degree, constructive dimension |
| 1 | Florin Manea, Victor Mitrana |
Hairpin Completion Versus Hairpin Reduction. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
hairpin completion, hairpin reduction, primitive hairpin root, formal languages, DNA computing |
| 1 | Andrzej Ehrenfeucht, Grzegorz Rozenberg |
Biochemical Reactions as Computations. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Itamar Pitowsky |
From Logic to Physics: How the Meaning of Computation Changed over Time. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Wiedermann, Lukás Petru |
Computability in Amorphous Structures. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
simulation, complexity, computability, universality, amorphous computers |
| 1 | Josep Freixas, Xavier Molinero, Salvador Roura |
Minimal Representations for Majority Games. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Weighted games, Majority games, Minimum and minimal weighted representations/realizations, Computing games, Simple games |
| 1 | Pieter W. Adriaans |
Learning as Data Compression. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
learning as compression, two-part code optimization, randomness deficiency, DFA induction, MDL |
| 1 | Jérôme Durand-Lose |
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
BSS model, Signal machine, Analog computation, Abstract geometrical computation |
| 1 | Sanjay Jain 0001, Eric Martin 0002, Frank Stephan 0001 |
Input-Dependence in Function-Learning. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
various forms of input presentation, team learning, learning with additional information, Inductive inference, recursion theory |
| 1 | Abbas Edalat |
A Continuous Derivative for Real-Valued Functions. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
L-derivative, Clarke gradient, weak* topology, upper semi-continuity |
| 1 | John Case |
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Remco Loos |
On Accepting Networks of Splicing Processors of Size 3. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Splicing, Networks of Processors, Molecular Computation |
| 1 | John Case, Samuel E. Moelius |
Characterizing Programming Systems Allowing Program Self-reference. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Computability Theory, Programming Language Semantics, Self-Reference |
| 1 | Pieter Collins |
Effective Computation for Nonlinear Systems. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Ariadne, nonlinear systems, computable analysis |
| 1 | Peng Zhang 0008 |
Approximating Generalized Multicut on Trees. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Generalized Multicut, Approximation Algorithm, Combinatorial Optimization, Tree |
| 1 | Heribert Vollmer |
Computational Complexity of Constraint Satisfaction. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, constraint satisfaction, polymorphism, clone, Galois connection, satisfiability problems |
| 1 | Margarita V. Korovina, Oleg V. Kudinov |
The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel David Hamkins, David Linetsky, Russell G. Miller |
The Complexity of Quickly ORM-Decidable Sets. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
ordinal computation, infinite time computation, hyperarithmetical hierarchy, complexity, computability, Ordinal, arithmetical hierarchy, register machine |
| 1 | Martin Olsen |
Nash Stability in Additively Separable Hedonic Games Is NP-Hard. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Nash Stability, Hedonic Games, NP-Completeness |
| 1 | Chung-Chih Li |
Speed-Up Theorems in Type-2 Computation. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Norman Danner, James S. Royer |
Time-Complexity Semantics for Feasible Affine Recursions. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip D. Welch |
Turing Unbound: Transfinite Computation. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel David Hamkins, Russell G. Miller |
Post's Problem for Ordinal Register Machines. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
ordinal computability, ordinal register machine, Post’s Problem, computability |
| 1 | Victor L. Selivanov |
A Useful Undecidable Theory. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
discrete weak semilattice, partition, theory, reducibility, undecidability, Semilattice |
| 1 | Maria Emilia Maietti |
Quotients over Minimal Type Theory. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Dependent type theory, quotient completion, intuitionistic logic |
| 1 | Alexandra A. Soskova |
A Jump Inversion Theorem for the Degree Spectra. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
enumeration degrees, degree spectra, Marker’s extensions, enumerations |
| 1 | Giovanni Sambin |
Doing Without Turing Machines: Constructivism and Formal Topology. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
minimalist foundation, pointfree topology, formal topology, constructive mathematics |
| 1 | Chi Tat Chong, Liang Yu |
Thin Maximal Antichains in the Turing Degrees. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber |
K -Trivial Closed Sets and Continuous Functions. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Computability, Randomness, Classes |
| 1 | Mariya Ivanova Soskova, Guohua Wu |
Cupping D20 Enumeration Degrees to 0 e '. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu |
Pseudojump Operators and P01 Classes. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Computability, Classes |
| 1 | Branislav Rovan, L'ubos Steskal |
Infinite Computations and a Hierarchy in Delta 3. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Super Turing computation, infinite computation, arithmetical hierarchy, Chomsky hierarchy |
| 1 | Hristo Ganchev |
Exact Pair Theorem for the omega -Enumeration Degrees. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
969, enumeration degrees, enumeration degrees, exact pair, jump |
| 1 | Oleg V. Kudinov, Victor L. Selivanov |
Definability in the Homomorphic Quasiorder of Finite Labeled Forests. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
homomorphic quasiorder, atomic structure, definability, forest, automorphism, Labeled tree |
| 1 | Eric Allender |
Reachability Problems: An Update. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ekaterina B. Fokina |
Index Sets of Computable Structures with Decidable Theories. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert I. Soare |
Computability and Incomputability. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Turing a-machine, Church-Turing Thesis, Kurt Gödel, Turing o-machine, computable approximations, effectively continuous functions on reals, computability in analysis, strong reducibilities reexamined, computability, Alan Turing |
| 1 | Andrew E. M. Lewis, Antonio Montalbán, André Nies |
A Weakly 2-Random Set That Is Not Generalized Low. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander G. Melnikov |
Enumerations and Torsion Free Abelian Groups. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Nicholas Charles Rhodes |
Rank Lower Bounds for the Sherali-Adams Operator. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Lift and Project Proof Systems, Rank Lower Bounds, Sherali-Adams Relaxation, Propositional Proof Complexity |
| 1 | Jörg Flum |
Parameterized Complexity and Logic. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Osamu Watanabe 0001, Mikael Onsjö |
Finding Most Likely Solutions. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Trautteur |
Does the Cell Compute? |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Virtuality, Computability, Systems biology |
| 1 | Julien Cervelle, Enrico Formenti, Pierre Guillon 0001 |
Sofic Trace Subshift of a Cellular Automaton. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
sofic systems, cellular automata, formal languages, symbolic dynamics, discrete-time dynamical systems |
| 1 | Keng Meng Ng, Frank Stephan 0001, Guohua Wu |
Degrees of Weakly Computable Reals. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Koepke |
Infinite Time Register Machines. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
| 1 | Alban Ponse, Mark van der Zwaag |
An Introduction to Program and Thread Algebra. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
Program Algebra, PGA, Thread Algebra |
| 1 | Paulin Jacobé de Naurois |
A Measure of Space for Computing over the Reals. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
BSS model of computation, weak model, space, algebraic complexity |
| 1 | Helmut Schwichtenberg |
Inverting Monotone Continuous Functions in Constructive Analysis. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Roy Dyckhoff, Stéphane Lengrand |
LJQ: A Strongly Focused Calculus for Intuitionistic Logic. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
purification, call-by-value semantics, depth-bounded, guarded logic, Sequent calculus, focused |
| 1 | Anton Setzer |
Partial Recursive Functions in Martin-Löf Type Theory. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
Martin-Löf type theory, Kleene index, Kleene brackets, partial recursive functions, inductive-recursive definitions, indexed induction-recursion, computability theory, recursion theory |
| 1 | Matthias Schröder 0001 |
Admissible Representations in Computable Analysis. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Brünnler |
Deep Inference and Its Normal Form of Derivations. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Josef Berger |
The Logical Strength of the Uniform Continuity Theorem. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
Constructive reverse mathematics, uniform continuity theorem |
| 1 | Klaus Meer |
Optimization and Approximation Problems Related to Polynomial System Solving. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Fredrik Dahlgren |
Partial Continuous Functions and Admissible Domain Representations. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
domain representations, computability theory, computable analysis, Domain theory |
| 1 | Martin Davis |
The Church-Turing Thesis: Consensus and Opposition. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paulo Oliva |
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Krajícek |
Forcing with Random Variables and Proof Complexity. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elvira Mayordomo |
Two Open Problems on Effective Dimension. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Peshev, Dimiter Skordev |
A Subrecursive Refinement of the Fundamental Theorem of Algebra. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregorio de Miguel Casado, Juan Manuel García Chamizo |
The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
Theoretical VLSI design, Type-2 Theory of Effectivity, Integral transforms, Algebraic specification, Convolution, Online-arithmetic |
| 1 | Greg Michaelson, W. Paul Cockshott |
Constraints on Hypercomputation. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Ehrhard, Laurent Regnier |
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David Doty |
Every Sequence Is Decompressible from a Random One. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
compression, Kolmogorov complexity, martingale, Turing reduction, random sequence, Constructive dimension |
| 1 | Jean-Charles Delvenne |
Turing Universality in Dynamical Systems. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Moser |
Martingale Families and Dimension in P. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Zach |
Kurt Gödel and Computability Theory. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Solon |
Co-total Enumeration Degrees. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tie Hou |
Coinductive Proofs for Basic Real Computation. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
Real computation, Coinductive proof, Signed digit streams, Minlog, Computability |
| 1 | Klaus Meer, Martin Ziegler 0001 |
Uncomputability Below the Real Halting Problem. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffery I. Zucker |
Primitive Recursive Selection Functions over Abstract Algebras. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Johann A. Makowsky |
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Erika Ábrahám, Andreas Grüner, Martin Steffen |
Heap-Abstraction for an Object-Oriented Calculus with Thread Classes. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license