Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Ludwig Staiger

Ludwig Staiger is a German mathematician and computer scientist at the Martin-Luther-Universität Halle-Wittenberg, Germany.Previously he had… Expand
Wikipedia

Related topics

Related topics

6 relations
Algorithmic information theoryAutomata theoryComputer scientistElectronic Colloquium on Computational Complexity
Expand

Broader (1)

Theory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Turing machines with activations of transitions
We consider Turing machines which perform infinite sequences of runs, where the (finite) number of computation steps in each run… Expand
2014
2014
An extended similarity distance for use with computable information estimators
  • U. Speidel
  • International Symposium on Information Theory and…
  • 2014
    • Corpus ID: 1121321
Computable complexity and information estimators such as those from the Lempel-Ziv family or Titchener's T-complexity and T… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2012
2012
Is there a universal image generator?
Abstract Synthetic pattern generation procedures have various applications, and a number of approaches (fractals, L-systems, etc… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2011
Review
2011
The lichens of Fakahatchee Strand Preserve State Park, Florida: Proceedings from the 18th Tuckerman Workshop
Fakahatchee Strand Preserve State Park is located in Collier County at the extreme southwestern corner of Florida, close to… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
2010
2010
A CTL-Based Logic for Program Abstractions
We define an action-based extension of the branching-time temporal logic CTL which allows path quantifiers to be restricted by… Expand
  • figure 1
  • figure 2
2009
2009
Series Is there a Universal Image Generator ?
Synthetic pattern generation procedures have various applications, and a number of approaches (fractals, L-systems, etc.) have… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 4
2008
2008
On the bounds of the Titchener T-complexity
  • U. Speidel
  • 6th International Symposium on Communication…
  • 2008
    • Corpus ID: 18638361
Titchenerpsilas T-complexity is a computable complexity measure for finite strings with practical applications in a number of… Expand
2008
2008
Topological Complexity of omega-Powers: Extended Abstract
This is an extended abstract presenting new results on the topological complexity of omega-powers (which are included in a paper… Expand
Review
2005
Review
2005
The WTO Dispute Settlement Mechanism: Battlefield or Cooperation?
EU-US trade disputes have recently caught much attention, because they have involved lasting non-compliance coupled with WTO… Expand
  • figure 1
  • figure 2
2003
2003
Complexity and Randomness Course notes , University of Auckland
2 Random finite strings 7 2.1 Plain Kolmogorov complexity . . . . . . . . . . . . . . . . . . 7 2.2 Prefix-free complexity… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE