Result 1 to 20 of 233 total
Inductive complexity of P versus NP problem. Extended abstract. (English)
Durand-Lose, Jérôme (ed.) et al., Unconventional computation and natural computation. 11th international conference, UCNC 2012, Orléan, France, September 3‒7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32893-0/pbk). Lecture Notes in Computer Science 7445, 2-9 (2012).
1
Introduction to the special issue: Computability of the physical. (English)
Math. Struct. Comput. Sci. 22, No. 5, 723-728 (2012).
2
The complexity of Euler’s integer partition theorem. (English)
Theor. Comput. Sci. 454, 72-80 (2012).
3
State-size hierarchy for finite-state complexity. (English)
Int. J. Found. Comput. Sci. 23, No. 1, 37-50 (2012).
4
Is there a universal image generator? (English)
Appl. Math. Comput. 218, No. 16, 8151-8159 (2012).
5
Randomness everywhere: my path to algorithmic information theory. (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). 179-189 (2011).
6
A multi-criteria metric algorithm for recommender systems. (English)
Fundam. Inform. 110, No. 1-4, 1-11 (2011).
7
Finite state complexity. (English)
Theor. Comput. Sci. 412, No. 41, 5668-5677 (2011).
8
Von Neumann normalisation and symptoms of randomness: An application to sequences of quantum random bits. (English)
Calude, Cristian S. (ed.) et al., Unconventional computation. 10th international conference, UC 2011, Turku, Finland, June 6‒10, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21340-3/pbk). Lecture Notes in Computer Science 6714, 40-51 (2011).
9
Unconventional computation. 10th international conference, UC 2011, Turku, Finland, June 6‒10, 2011. Proceedings. (English)
Lecture Notes in Computer Science 6714. Berlin: Springer (ISBN 978-3-642-21340-3/pbk). x, 247~p. EUR~49.22 (2011).
10
Von Neumann normalisation of a quantum random number generator. (English)
Comput. Res. Repos. 2011, Article No. 1101.4711 (2011).
11
Universal recursively enumerable sets of strings. (English)
Theor. Comput. Sci. 412, No. 22, 2253-2261 (2011).
12
Rainbow of computer science. Dedicated to Hermann Maurer on the occasion of his 70th birthday. (English)
Lecture Notes in Computer Science 6570. Berlin: Springer (ISBN 978-3-642-19390-3/pbk). xii, 285~p. EUR~49.22 (2011).
13
Representation of left-computable $ε$-random reals. (English)
J. Comput. Syst. Sci. 77, No. 4, 812-819 (2011).
14
An observer-based de-quantisation of Deutsch’s algorithm. (English)
Int. J. Found. Comput. Sci. 22, No. 1, 191-201 (2011).
15
Simplicity via provability for universal prefix-free Turing machines. (English)
Theor. Comput. Sci. 412, No. 1-2, 178-182 (2011).
16
Editorial (English)
IJUC 7, No. 5, 313 (2011).
17
Von Neumann normalisation and symptoms of randomness: an application to sequences of quantum random bits (English)
UC, 40-51 (2011).
18
The complexity of the four colour theorem. (English)
LMS J. Comput. Math. 13, 414-425, electronic only (2010).
19
A note on accelerated Turing machines. (English)
Math. Struct. Comput. Sci. 20, No. 6, 1011-1017 (2010).
20
Result 1 to 20 of 233 total
Start
Contact
Print
General Help
