no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Between Order and Chaos: The Quest for Meaningful Information
|
Adriaans, Pieter |
|
2009 |
45 |
4 |
p. 650-674 |
article |
2 |
Characterizing Programming Systems Allowing Program Self-Reference
|
Case, John |
|
2009 |
45 |
4 |
p. 756-772 |
article |
3 |
Circuit Complexity of Regular Languages
|
Koucký, Michal |
|
2009 |
45 |
4 |
p. 865-879 |
article |
4 |
Comparing Notions of Computational Entropy
|
Pinto, Alexandre |
|
2009 |
45 |
4 |
p. 944-962 |
article |
5 |
Computation and Logic in the Real World: CiE 2007
|
Cooper, S. Barry |
|
2008 |
45 |
4 |
p. 647-649 |
article |
6 |
Constructive Dimension and Turing Degrees
|
Bienvenu, Laurent |
|
2009 |
45 |
4 |
p. 740-755 |
article |
7 |
Depth as Randomness Deficiency
|
Antunes, Luís |
|
2009 |
45 |
4 |
p. 724-739 |
article |
8 |
Enumerations and Completely Decomposable Torsion-Free Abelian Groups
|
Melnikov, Alexander G. |
|
2009 |
45 |
4 |
p. 897-916 |
article |
9 |
Finding Most Likely Solutions
|
Onsjö, Mikael |
|
2009 |
45 |
4 |
p. 943 |
article |
10 |
Input-Dependence in Function-Learning
|
Jain, Sanjay |
|
2009 |
45 |
4 |
p. 849-864 |
article |
11 |
Nash Stability in Additively Separable Hedonic Games and Community Structures
|
Olsen, Martin |
|
2009 |
45 |
4 |
p. 917-925 |
article |
12 |
On the Universal Computing Power of Amorphous Computing Systems
|
Wiedermann, Jiří |
|
2009 |
45 |
4 |
p. 995-1010 |
article |
13 |
Planar and Grid Graph Reachability Problems
|
Allender, Eric |
|
2009 |
45 |
4 |
p. 675-723 |
article |
14 |
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
|
Case, John |
|
2009 |
45 |
4 |
p. 773-786 |
article |
15 |
Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines
|
Li, Chung-Chih |
|
2009 |
45 |
4 |
p. 880-896 |
article |
16 |
The λ-Calculus and the Unity of Structural Proof Theory
|
Espírito Santo, José |
|
2009 |
45 |
4 |
p. 963-994 |
article |
17 |
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
|
Fellows, Michael |
|
2009 |
45 |
4 |
p. 822-848 |
article |
18 |
Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions
|
Onsjö, Mikael |
|
2009 |
45 |
4 |
p. 926-942 |
article |
19 |
Two Algorithms in Search of a Type-System
|
Danner, Norman |
|
2009 |
45 |
4 |
p. 787-821 |
article |