Result 1 to 20 of 498 total
Avoiding simplicity is complex. (English)
Theory Comput. Syst. 51, No. 3, 282-296 (2012).
1
A Kolmogorov complexity proof of the Lovász local lemma for satisfiability. (English)
Theor. Comput. Sci. 461, 55-64 (2012).
2
On proofs of the incompleteness theorems based on Berry’s paradox by Vopěnka, Chaitin, and Boolos. (English)
Math. Log. Q. 58, No. 4-5, 307-316 (2012).
3
Separations of non-monotonic randomness notions. (English)
J. Log. Comput. 22, No. 4, 701-715 (2012).
4
Low-depth witnesses are easy to find. (English)
Comput. Complexity 21, No. 3, 479-497 (2012).
5
Constant compression and random weights. (English)
Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th ‒ March 3rd, 2012. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPICS ‒ Leibniz International Proceedings in Informatics 14, 172-181, electronic only (2012).
6
Learning with ordinal-bounded memory from positive data. (English)
J. Comput. Syst. Sci. 78, No. 5, 1623-1636 (2012).
7
Fixed-point tile sets and their applications. (English)
J. Comput. Syst. Sci. 78, No. 3, 731-764 (2012).
8
Lower bounds of shortest vector lengths in random NTRU lattices. (English)
Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16‒21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 143-155 (2012).
9
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).
10
Effectively approximating measurable sets by open sets. (English)
Theor. Comput. Sci. 428, 36-46 (2012).
11
Triviality and minimality in the degrees of monotone complexity. (English)
J. Log. Comput. 22, No. 2, 197-206 (2012).
12
Two notes on subshifts. (English)
Proc. Am. Math. Soc. 140, No. 5, 1617-1622 (2012).
13
Reducing tile complexity for the self-assembly of scaled shapes through temperature programming. (English)
Algorithmica 63, No. 1-2, 117-136 (2012).
14
Characterizing strong randomness via Martin-Löf randomness. (English)
Ann. Pure Appl. Logic 163, No. 3, 214-224 (2012).
15
Randomness and lowness notions via open covers. (English)
Ann. Pure Appl. Logic 163, No. 5, 506-518 (2012).
16
Is randomness native to computer science? Ten years after. (English)
Zenil, Hector (ed.), Randomness through computation. Some answers, more questions. Hackensack, NJ: World Scientific (ISBN 978-981-4327-74-9/hbk; 978-981-4327-75-6/ebook). 243-263 (2011).
17
Computability, algorithmic randomness and complexity. (English)
Zenil, Hector (ed.), Randomness through computation. Some answers, more questions. Hackensack, NJ: World Scientific (ISBN 978-981-4327-74-9/hbk; 978-981-4327-75-6/ebook). 223-241 (2011).
18
Metaphysics, metamathematics and metabiology. (English)
Zenil, Hector (ed.), Randomness through computation. Some answers, more questions. Hackensack, NJ: World Scientific (ISBN 978-981-4327-74-9/hbk; 978-981-4327-75-6/ebook). 93-103 (2011).
19
Mass problems associated with effectively closed sets. (English)
Tohoku Math. J. (2) 63, No. 4, Centen. Iss., 489-517 (2011).
20
Result 1 to 20 of 498 total
Start
Contact
Print
General Help
