Theoretical Computer Science, Volume 364

Volume 364, Number 1, November 2006

• Ricard Gavaldà, Eiji Takimoto:
  Foreword. 1-2
  

• Ilia Nouretdinov, Vladimir Vovk:
  Criterion of calibration for transductive confidence machine with limited feedback. 3-9
  
• Vladimir Vovk:
  Well-calibrated predictions from on-line compression models. 10-26
  
• Marcus Hutter:
  On generalized computable universal priors and their convergence. 27-41
  
• Sandra Zilles:
  An approach to intrinsic complexity of uniform learning. 42-61
  
• Eric Martin, Arun Sharma, Frank Stephan:
  On ordinal VC-dimension and some notions of complexity. 62-76
  
• Thomas Zeugmann:
  From learning in the limit to stochastic finite learning. 77-97
  
• Jin Uemura, Masako Sato:
  Learning of erasing primitive formal systems from positive examples. 98-114
  
• John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
  Learning a subclass of regular patterns in polynomial time. 115-131
  
• Genshiro Kitagawa:
  Signal extraction and knowledge discovery based on statistical modeling. 132-142
  

Volume 364, Number 2, November 2006

• Ruy J. G. B. de Queiroz, Patrick Cégielski:
  Preface. 143-145
  

• Gianluigi Bellin, Martin Hyland, Edmund Robinson, Christian Urban:
  Categorical proof theory of classical propositional calculus. 146-165
  
• Thomas Ehrhard, Laurent Regnier:
  Differential interaction nets. 166-195
  
• Olivier Finkel:
  On decidability properties of local sentences. 196-211
  
• Sven Hartmann, Sebastian Link:
  Deciding implication for functional dependencies in complex-value databases. 212-240
  
• Michael Kaminski, Julia Rubin-Mosin:
  Default theories over monadic languages. 241-253
  
• John Power:
  Generic models for computational effects. 254-269
  

Volume 364, Number 3, November 2006

• Martin Hofmann, Hans-Wolfgang Loidl:
  Preface. 271-272
  

• Frédéric Besson, Thomas P. Jensen, David Pichardie:
  Proof-carrying code from certified abstract interpretation and fixpoint compression. 273-291
  
• Peeter Laud, Tarmo Uustalu, Varmo Vene:
  Type systems equivalent to data-flow analyses for imperative languages. 292-310
  
• Andrew Kennedy:
  Securing the .NET programming model. 311-317
  
• Dominique Cansell, Dominique Méry:
  Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm. 318-337
  
• Joachim Niehren, Jan Schwinghammer, Gert Smolka:
  A concurrent lambda calculus with futures. 338-356