Result 1 to 20 of 962 total
How powerful are integer-valued martingales? (English)
Theory Comput. Syst. 51, No. 3, 330-351 (2012).
1
Computability of countable subshifts in one dimension. (English)
Theory Comput. Syst. 51, No. 3, 352-371 (2012).
2
Representing hyper-arithmetical sets by equations over sets of integers. (English)
Theory Comput. Syst. 51, No. 2, 196-228 (2012).
3
Representation theorems for analytic machines and computability of analytic functions. (English)
Theory Comput. Syst. 51, No. 1, 65-84 (2012).
4
Characterizing the strongly jump-traceable sets via randomness. (English)
Adv. Math. 231, No. 3-4, 2252-2293 (2012).
5
The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited. (English)
Theor. Comput. Sci. 457, 101-110 (2012).
6
P automata revisited. (English)
Theor. Comput. Sci. 454, 222-230 (2012).
7
Computably enumerable sets below random sets. (English)
Ann. Pure Appl. Logic 163, No. 11, 1596-1610 (2012).
8
Low linear orderings. (English)
J. Log. Comput. 22, No. 4, 745-754 (2012).
9
State-size hierarchy for finite-state complexity. (English)
Int. J. Found. Comput. Sci. 23, No. 1, 37-50 (2012).
10
Flexible and robust patterning by centralized gene networks. (English)
Fundam. Inform. 118, No. 4, 345-369 (2012).
11
Soundness and completeness of the cirquent calculus system CL6 for computability logic. (English)
Log. J. IGPL 20, No. 1, 317-330 (2012).
12
Local computability of computable metric spaces and computability of co-c.e. continua. (English)
Glas. Mat., III. Ser. 47, No. 1, 1-20 (2012).
13
Towards formalizing non-monotonic reasoning in physics: Logical approach based on physical induction and its relation to Kolmogorov complexity. (English)
Erdem, Esra (ed.) et al., Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz. Berlin: Springer (ISBN 978-3-642-30742-3/pbk). Lecture Notes in Computer Science 7265, 390-404 (2012).
14
Renaming is weaker than set agreement but for perfect renaming: A map of sub-consensus tasks. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 145-156 (2012).
15
A logical basis for constructive systems. (English)
J. Log. Comput. 22, No. 3, 605-642 (2012).
16
$\mathsf{RT}_{2}^{2}$ does not imply $\mathsf{WKL}_{0}$. (English)
J. Symb. Log. 77, No. 2, 609-620 (2012).
17
A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one. (English)
J. Symb. Log. 77, No. 2, 447-474 (2012).
18
Asynchronous extended spiking neural P systems with astrocytes. (English)
Gheorghe, Marian (ed.) et al., Membrane computing. 12th international conference, CMC 2011, Fontainebleau, France, August 23‒26, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28023-8/pbk). Lecture Notes in Computer Science 7184, 243-256 (2012).
19
Reaction automata. (English)
Theor. Comput. Sci. 429, 247-257 (2012).
20
Result 1 to 20 of 962 total
Start
Contact
Print
General Help
