| 139 |
|
--skipped-- |
07/2000 |
| 095 |
C.S. Calude |
A Characterization of C.E. Random Reals |
03/1999 |
| 267 |
M.R. Titchener, U. Speidel and J. Yang |
A Comparison of Practical Information Measures |
05/2005 |
| 157 |
S.Y.P. Lee and M.J. Dinneen |
A Conference Submission Web Server |
06/2001 |
| 038 |
F. Richman and D.S. Bridges |
A Constructive Proof of Gleason's Theorem |
05/1997 |
| 159 |
D.S. Bridges and L.S. Vita |
A Constructive Theory of Point-Set Nearness |
08/2001 |
| 283 |
C.S. Calude and G.J. Chaitin |
A Dialogue on Mathematics and Physics |
07/2006 |
| 320 |
C.S. Calude, B. E. Carpenter |
A Dialogue on the Internet |
04/2008 |
| 220 |
J.J. Arulanandham, C.S. Calude and M.J. Dinneen |
A Fast Natural Algorithm for Searching |
06/2003 |
| 039 |
C.S. Calude |
A Genius' Story: Two Books on Godel |
06/1997 |
| 345 |
M. Schimpf and K. Svozil |
A Glance at Singlet States and Four-Partite Correlations |
02/2009 |
| 093 |
C.S. Calude |
A Glimpse into Algorithmic Information Theory |
02/1999 |
| 117 |
C.S. Calude, G. Paun, and Monica Tataram |
A Glimpse into Natural Computing |
12/1999 |
| 077 |
P. Hertling |
A Lower Bound for Range Enclosure in Interval Arithmetic |
01/1998 |
| 322 |
A. Raichev and M.C. Wilson |
A New Approach to Asymptotics of Maclaurin Coefficients of Algebraic
Functions |
04/2008 |
| 329 |
M.J. Dinneen and A.J.L. Fenton |
A New Linear-Time Dominating Number Algorithm for Graphs of Bounded
Pathwidth |
07/2008 |
| 277 |
C.S. Calude, E. Calude and M.J. Dinneen |
A New Measure of the Difficulty of Problems |
02/2006 |
| 296 |
A. Raichev and M.C. Wilson |
A New Method for Computing Asymptotics of Diagonal Coefficients of
Multivariate Generating Functions |
01/2007 |
| 194 |
M. Ohya and I.V. Volovich |
A New Quantum Algorithm for NP-complete Problems |
09/2002 |
| 350 |
C. S. Calude and L. Staiger |
A Note on Accelerated Turing Machines |
02/2009 |
| 086 |
C.S. Calude, W. Merkle and Y. Wang |
A Note on Pseudorandom Generators |
05/1998 |
| 198 |
V.A. Adamyan, C.S. Calude and B. Pavlov |
A Quantum Scattering Approach to Undecidable Problems: Preliminary
Version |
10/2002 |
| 313 |
Y.-B. Kim and M.J. Dinneen |
A Repository of Compound Graphs for use in Large Network
Design |
11/2007 |
| 191 |
L. Staiger and H. Yamasaki |
A Simple Example of an omega-language Topologically Inequivalent to a
Regular One |
07/2002 |
| 358 |
K. Tadaki |
A Statistical Mechanical Interpretation of Algorithmic Information
Theory III: Composite Systems and Fixed Points |
04/2009 |
| 259 |
J. Yang and U. Speidel |
A T-decomposition Algorithm with O(n log n) Time and Space
Complexity |
01/2005 |
| 197 |
C.S. Calude, S. Marcus and L. Staiger |
A Topological Characterization of Random Sequences |
10/2002 |
| 221 |
E. Calude, B. Mills and L. Mills |
A Uniform Method for Testing Computational Complementarity |
06/2003 |
| 104 |
R.M. Solovay |
A Version of $\Omega$ for which ZFC can not Predict a Single
Bit |
05/1999 |
| 227 |
H. Ishihara and L.S. Vita |
A constructive Banach's inverse mapping theorem in
F-spaces |
12/2003 |
| 110 |
D.S. Bridges, C.S. Calude and L.S. Dediu (editors) |
Abstracts of Constructivity, Complexity, and Fuzziness (CCF
'99) |
07/1999 |
| 091 |
M.J. Dinneen (editor) |
Abstracts of the 2nd Japan - New Zealand Workshop on Logic in Computer
Science |
10/1998 |
| 257 |
B. Khoussainov (editor) |
Abstracts of the Workshop on Automata, Structures and
Logic |
12/2004 |
| 069 |
D.S. Bridges, F. Richman and P. Schuster |
Adjoints, Absolute Values and Polar Decompostions |
11/1997 |
| 319 |
K. Svozil |
Aesthetic Complexity |
04/2008 |
| 126 |
B. Khoussainov |
Algebraic Constraints, Automata, and Regular Languages |
03/2000 |
| 163 |
B. Khoussainov |
Algebraic Constraints, Automata, and Regular Languages
(Revised) |
11/2001 |
| 014 |
C. Calude |
Algorithmic Information Theory: Open Problems |
05/1996 |
| 248 |
C.S. Calude |
Algorithmic Randomness, Quantum Physics, and
Incompleteness |
08/2004 |
| 317 |
C.S. Calude and M. Zimand |
Algorithmically Independent Sequences |
01/2008 |
| 305 |
G.J. Chaitin |
An Algebraic Characterization of the Halting Probability |
04/2007 |
| 204 |
U. Guenther |
An Entropy Measure for Finite Strings based on the Shannon Entropy of
a Code Set |
12/2002 |
| 043 |
G. Alford |
An Explicit Construction of a Universal Extended H System |
08/1997 |
| 203 |
J. Yang and U. Guenther |
An Improved T-Decomposition Algorithm |
12/2002 |
| 001 |
J. Gibbons |
An Initial-Algebra Approach to Directed Acyclic Graphs |
04/1995 |
| 250 |
T. Forster |
An Introduction to WQO and BQO Theory (Preliminary
Version) |
09/2004 |
| 318 |
A.A. Abbott and M.J. Dinneen |
An Investigation of Algorithms to Aesthetically Draw Cayley
Graphs |
03/2008 |
| 138 |
C. Areces and V. Becher |
Analytic AGM Revision |
06/2000 |
| 187 |
V. Becher and G.J. Chaitin |
Another Example of Higher Order Randomness |
05/2002 |
| 356 |
M.J. Dinneen, N.R. Ke and M. Khosravani |
Arithmetic Progression Graphs |
03/2009 |
| 262 |
M.C. Wilson |
Asymptotics for Generalized Riordan Arrays |
04/2005 |
| 323 |
A. Raichev and M.C. Wilson |
Asymptotics of Coefficients of Multivariate Generating Functions:
Improvements for Smooth Points |
05/2008 |
| 307 |
A. Raichev and M.C. Wilson |
Asymptotics of Diagonal Coefficients of Multivariate Generating
Functions |
05/2007 |
| 142 |
R. Pemantle and M.C. Wilson |
Asymptotics of Multivariate Sequences II. Multiple Points of the
Singular Variety |
08/2000 |
| 301 |
G. Pritchard and M.C. Wilson |
Asymptotics of the Minimum Manipulating Coalition Size for Positional
Voting Rules under IC Behaviour |
02/2007 |
| 240 |
C.S. Calude, C. Campeanu and M. Dumitrescu |
Automata Recognizing No Words: A Statistical Approach |
05/2004 |
| 111 |
M.J. Dinneen and B. Khoussainov |
Automata with Equational Constraints |
08/1999 |
| 208 |
B. Khoussainov, S. Rubin and F. Stephan |
Automatic linear orders and trees (Revised) |
11/2003 |
| 256 |
J.J. Arulanandham and M.J. Dinneen |
Balance Machines: A New Formalism for Computing |
12/2004 |
| 223 |
J.J. Arulanandham, C.S. Calude and M.J. Dinneen |
Balance Machines: Computing = Balancing |
10/2003 |
| 171 |
J.J. Arulanandham, C.S. Calude and M.J. Dinneen |
Bead--Sort: A Natural Sorting Algorithm |
01/2002 |
| 226 |
C.S. Calude and G. Paun |
Bio-Steps Beyond Turing |
11/2003 |
| 092 |
C.S. Calude and E. Calude |
Bisimulations and Behaviour of Nondeterministic Automata |
02/1999 |
| 154 |
S. Filipp and K. Svozil |
Boole-Bell-type Inequalities in Mathematica |
05/2001 |
| 084 |
C.S. Calude and M.J. Dinneen |
Breaking the Turing Barrier |
05/1998 |
| 114 |
C.S. Calude |
Chaitin $\Omega$ Numbers, Solovay Machines, and
Incompleteness |
10/1999 |
| 359 |
K. Tadaki |
Chaitin Omega Numbers and Halting Problems |
04/2009 |
| 062 |
C.S. Calude and A. Nies |
Chaitin Omega Numbers and Strong Reducibilities |
10/1997 |
| 269 |
K. Svozil |
Characterization of Quantum Computable Decision Problems by State
Discrimination |
06/2005 |
| 205 |
J. Walsh and M.J. Dinneen |
Checking for Substructures in Graphs of Bounded Pathwidth and
Treewidth |
12/2002 |
| 035 |
B. Khoussainov, A. Yakhnis and V. Yakhnis |
Clusters of Two Player Games and Restricted Determinacy
Theorem |
05/1997 |
| 170 |
C.S. Calude and B. Pavlov |
Coins, Quantum Measurements, and Turing's Barrier |
12/2001 |
| 156 |
C.S. Calude and B. Pavlov |
Coins, Quantum Measurements, and Turing's Barrier: Preliminary
Version |
06/2001 |
| 276 |
A. Juarna and V. Vajnovszki |
Combinatorial Isomorphisms Beyond a Simion-Schmidt's
Bijection |
01/2006 |
| 258 |
K. Svozil |
Communication Cost of Breaking the Bell Barrier |
12/2004 |
| 340 |
C. Muller and M. Kohlhase |
Communities of Practice in Mathematical E-Learning |
11/2008 |
| 212 |
S.A. Terwijn |
Complexity and Randomness |
03/2003 |
| 190 |
S.S. Goncharov and B. Khoussainov |
Complexity of Computable Models |
05/2002 |
| 178 |
H. Ishihara and B. Khoussainov |
Complexity of Some Infinite Games Played on Finite Graphs |
02/2002 |
| 009 |
C. Calude and J. Hromkovic |
Complexity: A Language-Theoretic Point of View |
10/1995 |
| 026 |
M.J. Dinneen, J.A. Ventura, M.C. Wilson and G. Zakeri |
Compound Constructions of Minimal Broadcast Networks |
01/1997 |
| 332 |
M. Hoyrup |
Computability, Randomness and Ergodic Theory on Metric
Spaces |
09/2008 |
| 115 |
G. Kapoulas |
Computable $p$-adic Numbers |
11/1999 |
| 074 |
C.S. Calude and P.H. Hertling |
Computable Approximations of Reals: An Information-Theoretic
Analysis |
12/1997 |
| 181 |
B. Khoussainov and T. Kowalski |
Computable Isomorphism of Boolean Algebras with Operators |
03/2002 |
| 031 |
B. Khoussainov and R.A. Shore |
Computable Isomorphisms, Degree Spectra of Relations, and Scott
Families |
04/1997 |
| 087 |
H. Ishihara, B. Khoussainov and A. Nerode |
Computable Kripke Models and Intermediate Logics |
07/1998 |
| 023 |
P. Cholak, S.S. Goncharov, B. Khoussainov and R.A. Shore |
Computably Categorical Structures and Expansions by
Constants |
11/1996 |
| 024 |
B. Khoussainov, A. Nies and R.A. Shore |
Computably Presentable Models of Theories with Few Models |
12/1996 |
| 053 |
C.S. Calude and M. Lipponen |
Computational Complementarity and Sofic Shifts |
08/1997 |
| 083 |
C.S. Calude, E. Calude and C. Stefanescu |
Computational Complementarity for Mealy Automata |
05/1998 |
| 113 |
C.S. Calude, E. Calude and K. Svozil |
Computational Complementarity for Probabilistic Automata |
09/1999 |
| 133 |
M.D. Kearse and P.B. Gibbons |
Computational Methods and New Results for Chessboard
Problems |
05/2000 |
| 216 |
K. Svozil |
Computational Universes |
05/2003 |
| 206 |
S.S. Goncharov and B. Khoussainov |
Computationally Complete Computably Enumerable Algebras
(Removed) |
01/2003 |
| 146 |
C.S. Calude, M.J. Dinneen and C.-K. Shu |
Computing 80 Initial Bits of A Chaitin Omega Number |
11/2000 |
| 002 |
J. Gibbons |
Computing Downwards Accumulations on Trees Quickly |
03/1995 |
| 167 |
C.S. Calude, M.J. Dinneen and C.-K. Shu |
Computing a Glimpse of Randomness |
12/2001 |
| 246 |
C.S. Calude and G. Paun |
Computing with Cells and Atoms: After Five Years |
08/2004 |
| 119 |
G. Paun |
Computing with Membranes (P Systems): Twenty Six Research
Topics |
02/2000 |
| 098 |
G. Paun |
Computing with Membranes: A Variant |
03/1999 |
| 123 |
J. Castellanos, G. Paun and A. Rodriguez-Paton |
Computing with Membranes: P Systems with Worm-Objects |
02/2000 |
| 270 |
S. Comorosan |
Computing with Molecules: A New Type of Quantum Molecular
Computation |
07/2005 |
| 210 |
L. Staiger |
Constructive Dimension equals Kolmogorov Complexity |
01/2003 |
| 068 |
D.S. Bridges and S. Reeves |
Constructive Mathematics, in Theory and Programming
Practice |
11/1997 |
| 341 |
C. Muller and M. Kohlhase |
Context-Aware Adaptation. A Case Study on Mathematical
Notations |
11/2008 |
| 071 |
C. Martin-Vide and G. Paun |
Cooperating Distributed Splicing Systems |
12/1997 |
| 107 |
C.S. Calude, M.J. Dinneen and K. Svozil |
Counterfactual Effect, the Halting Problem, and the Busy Beaver
Function |
07/1999 |
| 361 |
K. Svozil |
Cryptography with Quanta and Chocolate Balls |
04/2009 |
| 353 |
K. Svozil |
Crytography with Quanta and Chocolate Balls |
03/2009 |
| 072 |
G. Paun |
DNA Computing Based on Splicing: Universality Results |
12/1997 |
| 285 |
C.S. Calude |
De-Quantising the Solution of Deutsch's Prolem |
08/2006 |
| 027 |
H. Ishihara, B. Khoussainov and A. Nerode |
Decidable Kripke Models of Intuitionistic Theories |
01/1997 |
| 209 |
B. Khoussainov, S. Rubin and F. Stephan |
Definability and Regularity in Automatic Presentations of Subsystems
of Arithmetic |
01/2003 |
| 162 |
D.R. Hirschfeldt, B. Khoussainov, R.A. Shore and A.M. Slinko |
Degree Spectra and Computable Dimensions in Algebraic
Structures |
10/2001 |
| 080 |
M.J. Dinneen, G. Pritchard and M.C. Wilson |
Degree- and Time- Constrained Broadcast Networks |
04/1998 |
| 090 |
C.S. Calude, R.J. Coles, P.H. Hertling and B. Khoussainov |
Degree-Theoretic Aspects of Computably Enumerable Reals |
09/1998 |
| 003 |
J. Gibbons |
Deriving Tidy Drawings of Trees |
06/1995 |
| 303 |
A. Nies |
Describing Groups |
03/2007 |
| 311 |
S. Drape and A. Majumdar |
Design and Evaluation of Slicing Obfuscation |
06/2007 |
| 025 |
C. Calude, E. Calude and B. Khoussainov |
Deterministic Automata: Simulation, Universality and
Minimality |
12/1996 |
| 255 |
M.R. Titchener, A. Gulliver, R. Nicolescu, U. Speidel and L.
Staiger |
Deterministic Complexity and Entropy |
12/2004 |
| 040 |
E. Calude and M. Lipponen |
Deterministic Incomplete Automata: Simulation, Universality and
Complementarity |
06/1997 |
| 219 |
C.S. Calude |
Dialogues on Quantum Computing |
06/2003 |
| 011 |
A. Arslanov |
Difference Splittings of Recursively Enumerable Sets |
01/1996 |
| 063 |
C.S. Calude, L. Priese and L. Staiger |
Disjunctive Sequences: An Overview |
10/1997 |
| 032 |
C.S. Calude, P.H. Hertling and B. Khoussainov |
Do the Zeros of the Riemann's Zeta-Function Form a Random
Sequence? |
04/1997 |
| 131 |
B. Khoussainov and R.A. Shore |
Effective Model Theory: The Number of Models and Their
Complexity |
03/2000 |
| 051 |
R.G. Downey and C.G. Jockusch Jr |
Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank
1 |
08/1997 |
| 065 |
P. Hertling |
Embedding Cellular Automata into Reversible Ones |
10/1997 |
| 036 |
C.S. Calude, P.H. Hertling and K. Svozil |
Embedding Quantum Universes into Classical Ones |
05/1997 |
| 150 |
C.S. Calude and M. Dumitrescu |
Entropic Measures, Markov Information Sources and
Complexity |
02/2001 |
| 214 |
K. Svozil |
Eutatic Quantum Codes |
04/2003 |
| 343 |
C.S. Calude and E. Calude |
Evaluating the Complexity of Mathematical Problems. Part 1 |
12/2008 |
| 328 |
C.S. Calude and N.J. Hay |
Every Computably Enumerable Random Real Is Provably Computably
Enumerable Random |
07/2008 |
| 337 |
G.J. Chaitin |
Evolution of Mutating Software |
10/2008 |
| 293 |
C.S. Calude and M.J. Dinneen |
Exact Approximations of Omega Numbers |
12/2006 |
| 274 |
G. Pritchard and M.C. Wilson |
Exact Results on Manipulability of Positional Voting Rules |
12/2005 |
| 041 |
M. Conder |
Explicit Definition of the Binary Reflected Gray Codes |
06/1997 |
| 231 |
K. Svozil |
Farewell to Quantum Contextuality? |
01/2004 |
| 242 |
A. Juarna and V. Vajnovszki |
Fast Generation of Fibonacci Permutations |
07/2004 |
| 066 |
V.E. Cazanescu |
Feedback for Relations |
11/1997 |
| 155 |
N. Donath and K. Svozil |
Finding a State in a Haystack |
05/2001 |
| 237 |
H. Juergensen, L. Staiger and H. Yamasaki |
Finite Automata Encoding Geometric Figures |
04/2004 |
| 128 |
B. Khoussainov and S. Rubin |
Finite Automata and Isomorphism Types |
03/2000 |
| 054 |
C.S. Calude, E. Calude and B. Khoussainov |
Finite Nondeterministic Automata: Simulation and
Minimality |
09/1997 |
| 189 |
B. Khoussainov |
Finite State Strategies in One Player McNaughton Games |
05/2002 |
| 245 |
M. Harmer |
Fitting Parameters for a Solvable Model of a Quantum
Network |
07/2004 |
| 355 |
K. Tadaki |
Fixed Point Theorems on Partitial Randomness |
03/2009 |
| 019 |
M.J. Dinneen, K. Cattell and M.R. Fellows |
Forbidden Minors to Graphs with Small Feedback Sets |
10/1996 |
| 354 |
C.S. Calude and C. Müller |
Formal Proof: Reconciling Correctness and Understanding |
03/2009 |
| 108 |
C. Grozea |
Free-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin
Theorem |
07/1999 |
| 235 |
C.S. Calude and M.A. Stay |
From Heisenberg to Goedel via Chaitin |
02/2004 |
| 174 |
B. Khoussainov |
Games Played on Finite Graphs and Temporal Logic |
01/2002 |
| 207 |
B. Khoussainov and T. Kowalski |
Games on Graphs: Automata, Structure, and Complexity |
01/2003 |
| 045 |
B. Khoussainov, A. Yakhnis and V. Yakhnis |
Games with Unknown Past |
08/1997 |
| 218 |
C.S. Calude and L. Staiger |
Generalisations of Disjunctive Sequences |
06/2003 |
| 249 |
M. Stay |
Generalized Number Derivatives |
08/2004 |
| 082 |
M.J. Dinneen |
Group-Theoretic Methods for Designing Networks |
05/1998 |
| 078 |
R. Laue |
Halvings on Small Point Sets |
01/1998 |
| 272 |
L. Staiger |
Hausdorff Measure and Lukasiewicz Languages |
11/2005 |
| 330 |
B Kjos-Hanssen, A. Nies, F. Stephan and L. Yu |
Higher Kurtz Randomness |
08/2008 |
| 302 |
C.T. Chong, A. Nies and L. Yu |
Higher Randomness Notions and Their Lowness Properties |
03/2007 |
| 010 |
L. Dediu |
Higman's Embedding Theorem. An Elementary Proof |
10/1995 |
| 175 |
L. Staiger |
How Large is the Set of Disjunctive Sequences? |
01/2002 |
| 294 |
G.J. Chaitin |
How Much Information Can There Be in a Real Number |
01/2007 |
| 315 |
A. Leitsch, G. Schachner and K. Svozil |
How to Acknowledge Hypercomputation? |
12/2007 |
| 186 |
J.J. Arulanandham |
Implementing Bead--Sort with P systems |
05/2002 |
| 058 |
H.W. Guesgen |
Imprecise Reasoning about Geographic Information |
09/1997 |
| 166 |
C.S. Calude |
Incompleteness, Complexity, Randomness and Beyond |
11/2001 |
| 324 |
C.S. Calude |
Incompleteness: A Personal Perspective |
06/2008 |
| 331 |
S. Figueira, J. Miller and A. Nies |
Indifferent Sets |
08/2008 |
| 243 |
M. Stay |
Inexpensive Linear-Optical Implementations of Deutsch's
Algorithm |
07/2004 |
| 264 |
L. Staiger |
Infinite Iterated Function Systems in Cantor Space and the Hausdorff
Measure of omega-power Languages |
04/2005 |
| 200 |
G. Kapoulas |
Infinitesimals Via the Cofinite Filter |
12/2002 |
| 229 |
H. Ishihara |
Informal Constructive Mathematics |
01/2004 |
| 292 |
C.S. Calude |
Information: The Algorithmic Paradigm |
12/2006 |
| 120 |
G. Krenn, J. Summhammer and K. Svozil |
Interferometric Information Gain Versus Interaction-Free
Measurement |
02/2000 |
| 061 |
P. Hertling and Y. Wang |
Invariance Properties of Random Sequences |
10/1997 |
| 241 |
C.S. Calude and H. Juergensen |
Is Complexity a Source of Incompleteness? |
06/2004 |
| 281 |
G.J. Chaitin |
Is Incompleteness A Serious Problem |
07/2006 |
| 089 |
F.W. Meyerstein |
Is Movement An Illusion? Zeno's Paradox From a Modern
Viewpoint |
09/1998 |
| 021 |
C. Calude and F.W. Meyerstein |
Is the Universe Lawful? |
11/1996 |
| 344 |
C.S. Calude and J.P. Lewis |
Is there a Universal Image Generator |
01/2009 |
| 013 |
C. Calude and C. Grozea |
Kraft-Chaitin Inequality Revisited |
04/1996 |
| 007 |
C. Calude and S. Yu |
Language-Theoretic Complexity of Disjunctive Sequences |
09/1995 |
| 004 |
P.R. Hafner |
Large Cayley Graphs and Digraphs with Small Degree and
Diameter |
06/1995 |
| 160 |
F.W. Meyerstein and A.P. Moller |
LifeTime: A Unified Study of Life (A Preliminary Version) |
09/2001 |
| 037 |
D.S. Bridges, F. Richman and P. Schuster |
Linear Independence and Choice |
05/1997 |
| 179 |
K. Svozil |
Logical Equivalence Between Generalized Urn Models and Finite
Automata |
02/2002 |
| 289 |
G. Firror, T. Mansour and M.C. Wilson |
Longest Alternating Subsequences in Pattern-Restricted
Permutations |
10/2006 |
| 201 |
A. Nies |
Lowness Properties of Reals and Randomness |
12/2002 |
| 363 |
A. Nies |
Lowness for Computable and Partial Computable Randomness |
04/2009 |
| 278 |
S. Schwarz |
Lukasiewicz Logics and Weighted Logics over MV-Semirings |
05/2006 |
| 153 |
U. Guenther |
Matching T-Codes to a Source |
04/2001 |
| 236 |
C.S. Calude and S. Marcus |
Mathematical Proofs at a Crossroad? |
03/2004 |
| 182 |
G.J. Chaitin |
Meta-Mathematics and the Foundations of Mathematics |
05/2002 |
| 099 |
C.S. Calude, K. Salomaa and S. Yu |
Metric Lexical Analysis |
03/1999 |
| 060 |
E. Calude and M. Lipponen |
Minimal Deterministic Incomplete Automata |
10/1997 |
| 116 |
C.S. Calude, H. Ishihara and T. Yamaguchi |
Minimal Programs Are Almost Optimal |
11/1999 |
| 284 |
C.S. Calude and M.A. Stay |
Most Short Programs Halt Quickly or Never Halt |
08/2006 |
| 101 |
G. Paun and G. Thierrin |
Multiset Processing by means of Systems of Sequential
Transducers |
04/1999 |
| 273 |
C.S. Calude and M.A. Stay |
Natural Halting Probabilities, Partial Randomness, and Zeta
Functions |
11/2005 |
| 266 |
R. Eimann, U. Speidel, N. Brownlee and J. Yang |
Network Event Detection with T-Entropy |
05/2005 |
| 357 |
R. Reyhani, G. Pritchard and M.C. Wilson |
New Measures of the Diffculty of Manipulation of Voting
Rules |
03/2009 |
| 082 |
C.S. Calude |
News from New Zealand |
05/1998 |
| 046 |
B. Khoussainov and A.M. Slinko |
Nonassociative Computable Rings and Their Isomorphisms |
08/1997 |
| 121 |
H. Havlicek, G. Krenn, J. Summhammer and K. Svozil |
On Coloring the Rational Quantum Sphere |
02/2000 |
| 176 |
S.S. Goncharov and B. Khoussainov |
On Complexity of Computatable $\aleph_1$--Categorical
Models |
01/2002 |
| 125 |
B. Khoussainov |
On Computable Theoretic Properties of Structures and Their Cartesian
Products |
03/2000 |
| 050 |
K. Cattell, M.J. Dinneen, R.G. Downey, M.R. Fellows and M.A.
Langston |
On Computing Graph Minors Obstruction Sets |
08/1997 |
| 151 |
H.L. Bodlaender, M.J. Dinneen and B. Khoussainov |
On Game-Theoretic Models of Networks |
04/2001 |
| 081 |
A. Arslanov |
On Hypersimple Sets and Chaitin Complexity |
04/1998 |
| 029 |
R.J. Coles, R.G. Downey and B. Khoussainov |
On Initial Segments of Computable Linear Orders |
03/1997 |
| 172 |
H. Ishihara, B. Khoussainov and S. Rubin |
On Isomorphism Invariants of Some Automatic Structures |
01/2002 |
| 280 |
L. Staiger |
On Maximal Prefix Codes |
05/2006 |
| 334 |
L. Staiger |
On Oscillation-free ε-random Sequences |
09/2008 |
| 239 |
C.S. Calude, L. Staiger and S.A. Terwijn |
On Partial Randomness |
04/2004 |
| 290 |
T.A. Gulliver and U. Speidel |
On T-Codes and Necklaces |
10/2006 |
| 312 |
C.S. Calude and L. Staiger |
On Universal Computably Enumerable Prefix Codes |
10/2007 |
| 034 |
A. Arslanov |
On a Conjecture of M. Van Lambalgen |
05/1997 |
| 094 |
C.S. Calude and R.J. Coles |
On a Theorem of Solovay |
02/1999 |
| 022 |
I. Tomescu |
On a problem of L. Priese |
11/1996 |
| 360 |
K. Svozil |
On the Brightness of the Thomson Lamp. A Prolegomenon to Quantum
Recursion Theory |
04/2009 |
| 177 |
I. Tomescu |
On the Number of Occurrences of All Short Factors in Almost All
Words |
02/2002 |
| 047 |
R.G. Downey |
On the Universal Splitting Property |
08/1997 |
| 124 |
S.S. Goncharov and B. Khoussainov |
Open Problems in the Theory of Constructive Algebraic
Systems |
03/2000 |
| 275 |
N.J. Hay |
Optimal Agents |
12/2005 |
| 351 |
P.H. Potgieter and E.E. Rosinger |
Output Concepts for Accelerated Turing Machines |
02/2009 |
| 102 |
G. Paun |
P Systems with Active Membranes: Attacking NP Complete
Problems |
05/1999 |
| 056 |
D.S. Bridges and L.S. Dediu |
Paradise Lost, or Paradise Regained? |
09/1997 |
| 188 |
G.J. Chaitin |
Paradoxes of Randomness |
05/2002 |
| 049 |
R.G. Downey, M.R. Fellows and K.W. Regan |
Parameterized Circuit Complexity and the W Hierarchy |
08/1997 |
| 180 |
C.S. Calude, E. Calude and S. Marcus |
Passages of Proof |
02/2002 |
| 299 |
K. Svozil |
Physical Unknowables |
01/2007 |
| 015 |
C. Calude, E. Calude, K. Svozil and S. Yu |
Physical versus Computational Complementarity I |
06/1996 |
| 352 |
J.C. Baez and M. Stay |
Physics, Topology, Logic and Computation: A Rosetta Stone |
03/2009 |
| 247 |
C. Grozea |
Plagiarism Detection with State of the Art Compression
Programs |
08/2004 |
| 055 |
M.J. Dinneen |
Practical Enumeration Methods for Graphs of Bounded Pathwidth and
Treewidth |
09/1997 |
| 140 |
C.S. Calude, M.J. Dinneen and G. Paun (editors) |
Pre-Proceedings of the Workshop on Multiset Processing |
08/2000 |
| 327 |
C.S. Calude and J.F. Costa (editors) |
Pre-proceedings of the Workshop Physics and Computation |
07/2008 |
| 298 |
L. Staiger |
Prefix-free Lukasiewicz Languages |
01/2007 |
| 135 |
R.G. Downey and G.L. LaForte |
Presentations of Computably Enumerable Reals |
05/2000 |
| 287 |
G. Pritchard and M.C. Wilson |
Probability Calculations Under the IAC Hypothesis |
10/2006 |
| 228 |
M.C. Wilson |
Probability Generating Functions for Sattolo's Algorithm |
01/2004 |
| 321 |
J. Teutenberg (editor) |
Proceedings of the Computer Graduate Workshop 2007 |
04/2008 |
| 253 |
M. Margenstern (editor) |
Proceedings of the International Workshop on Tilings and Cellular
Automata |
11/2004 |
| 222 |
V. Becher, S. Figueira, A. Nies and S. Picchi |
Program Size Complexity for Possibly Infinite Computations |
08/2003 |
| 008 |
G.J. Chaitin, A. Arslanov and C. Calude |
Program-Size Complexity Computes the Halting Problem |
09/1995 |
| 254 |
M.J. Dinneen and R. Lai |
Properties of Vertex Cover Obstructions |
11/2004 |
| 348 |
K. Svozil |
Proposed Direct Test of Quantum Contextuality |
02/2009 |
| 309 |
C.S. Calude, E. Calude and S. Marcus |
Proving and Programming |
06/2007 |
| 251 |
C.S. Calude and S. Rudeanu |
Proving as a Computable Procedure |
10/2004 |
| 106 |
C.S. Calude, E. Calude and K. Svozil |
Quantum Correlations Conundrum: An Automaton-Theoretic
Approach |
06/1999 |
| 012 |
I. Antoniou, B. Pavlov and A. Yafyasov |
Quantum Electronic Devices Based on Metal-Dielectric Transition in
Low-Dimensional Quantum Structures |
04/1996 |
| 306 |
C.S. Calude and J. Gruska |
Quantum Informatics and the Relations Between Informatics, Physics and
Mathematics: A Dialogue |
05/2007 |
| 233 |
K. Svozil |
Quantum Information via State Partitions and the Context Transition
Principle |
01/2004 |
| 145 |
K. Svozil |
Quantum Information: The New Frontier |
09/2000 |
| 136 |
K. Svozil |
Quantum Interfaces |
05/2000 |
| 291 |
C.S. Calude and K. Svozil |
Quantum Randomness and Value Indefiniteness |
11/2006 |
| 349 |
K. Svozil |
Quantum Scholasticism: On Quantum Contexts, Counterfactuals, and the
Absurdities of Quantum Omniscience |
02/2009 |
| 268 |
D.M. Greenberger and K. Svozil |
Quantum Theory Looks at Time Travel |
06/2005 |
| 260 |
H. Ishihara, R. Mines, P. Schuster, and L.S. Vita |
Quasi-Apartness and Neighbourhood Spaces |
03/2005 |
| 224 |
A. Moreira |
RNA Rings in the Origin of Life |
10/2003 |
| 244 |
D. Schultes |
Rainbow Sort:Sorting at the Speed of Light |
07/2004 |
| 295 |
M.C. Wilson |
Random and Exhaustive Generation of Permuations and Cycles |
01/2007 |
| 213 |
C.S. Calude, L. Staiger and K. Svozil |
Randomness Relative to Cantor Expansions |
04/2003 |
| 079 |
P. Hertling and K. Weihrauch |
Randomness Spaces |
01/1998 |
| 333 |
C.R. Gonzalez |
Randomness and Ergodic Theory: An Algorithmic Point of
View |
09/2008 |
| 148 |
R.G. Downey, D.R. Hirschfeldt and G.L. LaForte |
Randomness and Reducibility |
01/2001 |
| 364 |
K. Svozil |
Randomness in Physics: Five Questions, Some Answers |
05/2009 |
| 100 |
C.S. Calude, P. Hertling, H. Juergensen and K. Weihrauch |
Randomness on Full Shift Spaces |
04/1999 |
| 017 |
B. Khoussainov |
Randomness, Computability, and Algebraic Specifications |
08/1996 |
| 144 |
R.G. Downey, D.R. Hirschfeldt and A. Nies |
Randomness, Computability, and Density |
09/2000 |
| 234 |
A. Nies, F. Stephan and S.A. Terwijn |
Randomness, Relativization, and Turing Degrees |
02/2004 |
| 033 |
Y. Wang |
Randomness, Stochasticity and Approximations |
04/1997 |
| 141 |
C.S. Calude |
Real Numbers: From Computable to Random |
08/2000 |
| 202 |
A. Nies |
Reals which Compute Little |
12/2002 |
| 059 |
C.S. Calude, P.H. Hertling, B. Khoussainov and Y. Wang |
Recursively Enumerable Reals and Chaitin Omega Numbers |
10/1997 |
| 335 |
J. Mielke |
Refined Bounds on Kolmorgorov Complexity for ω-Languages |
09/2008 |
| 130 |
C.S. Calude, M.J. Dinneen and K. Svozil |
Reflections on Quantum Computing |
03/2000 |
| 158 |
C. Grozea |
Relations Between the Low Subrecursion Classes |
07/2001 |
| 365 |
C. S. Calude, N.J. Hay and F.C. Stephan |
Representation of Left-Computable ε-Random Reals |
05/2009 |
| 044 |
U. Guenther, P. Hertling, R. Nicolescu and M. Titchener |
Representing Variable-Length Codes in Fixed-Length T-Depletion Format
in Encoders and Decoders |
08/1997 |
| 347 |
M. Schaller and K. Svozil |
Scale-Invariant Cellular Automata and Recursive Petri Nets |
02/2009 |
| 137 |
K. Svozil |
Science at the Crossroad Between Randomness and
Determinism |
05/2000 |
| 018 |
B. Khoussainov and R.A. Shore |
Scott Families and Computably Categorical Structures |
09/1996 |
| 085 |
P.C. Denny |
Search and Enumeration Techniques for Incidence Structures |
05/1998 |
| 336 |
M.J. Dinneen and M. Khosravani |
Searching for Spanning k-Caterpillars and k-Trees |
09/2008 |
| 020 |
D.S. Bridges and R. Mines |
Sequentially Continuous Linear Mappings in Constructive
Analysis |
10/1996 |
| 339 |
C.S. Calude |
Simplicity via Provability for Universal Prefix-free Turing
Machines |
11/2008 |
| 232 |
K. Svozil |
Single Particle Interferometric Analogues of Multipartite
Entanglement |
01/2004 |
| 168 |
M. Deza, M. Dutour and E. Panteleev |
Small Cones of Oriented Semi-Metrics |
12/2001 |
| 042 |
M. Conder |
Small Trivalent Graphs of Large Girth |
06/1997 |
| 030 |
S. Legg |
Solomonoff Induction |
03/1997 |
| 122 |
K. Svozil |
Solution of Problem No. 10769 |
02/2000 |
| 129 |
B. Khoussainov and R.A. Shore |
Solutions of the Goncharov-Millar and Degree Spectra Problems in The
Theory of Computable Models |
03/2000 |
| 112 |
C.S. Calude, H. Juergensen and S. Legg |
Solving Problems with Finite Test Sets |
09/1999 |
| 199 |
J.J. Arulanandham, C.S. Calude and M.J. Dinneen |
Solving SAT with Bilateral Computing |
12/2002 |
| 173 |
R.G. Downey |
Some Computability-Theoretical Aspects of Reals and
Randomness |
01/2002 |
| 346 |
K. Svozil |
Some Observations Concerning the Plasticity of Nonlocal Quantum
Correlations Exceeding Classical Expectations |
02/2009 |
| 185 |
B. Khoussainov and S. Rubin |
Some Thoughts On Automatic Structures |
05/2002 |
| 282 |
G.J. Chaitin |
Speculations on Biology, Information and Complexity |
07/2006 |
| 342 |
R. Nicolescu, M.J. Dinneen and Y.-B. Kim |
Structured Modelling with Hyperdag P Systems: Part A |
12/2008 |
| 152 |
C.S. Calude, M.J. Dinneen and S. Sburlan (editors) |
Supplemental Abstracts for DMTCS01 |
04/2001 |
| 252 |
C.S. Calude, E. Calude, M.J. Dinneen (editors) |
Supplemental Papers for DLT04 |
11/2004 |
| 215 |
C.S. Calude, M.J. Dinneen and V. Vajnovszki (editors) |
Supplemental Papers for DMTCS03 |
05/2003 |
| 147 |
I. Antoniou, C.S. Calude and M.J. Dinneen (editors) |
Supplemental Papers for the 2nd Unconventional Models of Computation
Conference |
11/2000 |
| 195 |
C.S. Calude, M.J. Dinneen and F. Peper (editors) |
Supplemental Papers for the 3nd Unconventional Models of Computation
Conference |
10/2002 |
| 064 |
P. Hertling |
Surjective Functions on Computably Growing Cantor Sets |
10/1997 |
| 149 |
U. Guenther |
T-Complexity and T-Information Theory -- an Executive
Summary |
02/2001 |
| 286 |
U. Speidel |
T-Complexity and T-Information Theory--an Executive Summary, 2nd
revised version |
10/2006 |
| 109 |
C.S. Calude, E. Calude, T. Chiou, M. Dumitrescu and R. Nicolescu |
Testing Computational Complementarity for Mermin Automata |
07/1999 |
| 230 |
S. Filipp and K. Svozil |
Testing the Bounds on Quantum Probabilities |
01/2004 |
| 134 |
C.S. Calude and M.J. Dinneen (editors) |
The 5th Anniversary Workshop on Discrete Mathematics and Theoretical
Computer Science |
05/2000 |
| 161 |
C.S. Calude and E. Calude |
The Bridge Crossing Problem: Draft Form |
09/2001 |
| 193 |
N. Zhou |
The Broadcasting Problem For Bounded-Degree Directed
Networks |
09/2002 |
| 070 |
D.S. Bridges, C. Calude, B. Pavlov and D. Stefanescu |
The Constructive Implicit Function Theorem and Applications in
Mechanics |
11/1997 |
| 288 |
M.E. Lladser, P. Potocnik, J. Siran, J. Siagiova and M.C. Wilson |
The Diameter of Random Cayley Digraphs of Given Degree |
10/2006 |
| 067 |
P. Hertling |
The Effective Riemann Mapping Theorem |
11/1997 |
| 192 |
L. Staiger |
The Entropy of Lukasiewicz Languages |
08/2002 |
| 304 |
R.W. Doran |
The Gray Code |
03/2007 |
| 325 |
G.J. Chaitin |
The Halting Probability via Wang Tiles |
06/2008 |
| 088 |
L. Staiger |
The Hausdorff Measure of Regular Omega-Languages is
Computable |
08/1998 |
| 169 |
M. Dutour and M. Deza |
The Hypermetric Cone on Seven Vertices |
12/2001 |
| 279 |
L. Staiger |
The Kolmogorov Complexity of Infinite Words |
05/2006 |
| 096 |
L. Staiger |
The Kolmogorov Complexity of Liouville Numbers |
03/1999 |
| 118 |
M.J. Dinneen and L. Xiong |
The Minor-Order Obstructions for The Graphs of Vertex Cover
Six |
01/2000 |
| 052 |
R.G. Downey, M.R. Fellows, A. Vardy and G. Whittle |
The Parameterized Complexity of Some Fundamental Problems in Coding
Theory |
08/1997 |
| 316 |
B. Whitworth |
The Physical World as a Virtual Reality |
12/2007 |
| 132 |
C.S. Calude and B. Pavlov |
The Poincare-Hardy Inequality on the Complement of a Cantor
Set |
05/2000 |
| 057 |
P. Hertling |
The Real Number Structure is Effectively Categorical |
09/1997 |
| 310 |
S. Drape |
The Suitability of Different Binary Tree Obfuscations |
06/2007 |
| 005 |
J. Gibbons |
The Third Homomorphism Theorem |
07/1995 |
| 211 |
M. Margenstern |
The Tiling of the Hyperbolic 4D Space by the 120-Cell Is
Combinatoric |
02/2003 |
| 314 |
E. Goles, Cedric Littleand and I. Rapaport |
The Underlying Optimal Protocol of Rule 218 Cellular
Automaton |
11/2007 |
| 238 |
S. Filipp and K. Svozil |
The min-max Principle Generalizes Tsirelson's Bound |
04/2004 |
| 362 |
K. Svozil |
Three Criteria for Quantum Random Number Generators Based on Beam
Splitters |
04/2009 |
| 338 |
C.S. Calude, H. Juergensen and L. Staiger |
Topology on Words |
11/2008 |
| 006 |
J. Gibbons and K. Wansbrough |
Tracing Lazy Functional Languages |
08/1995 |
| 271 |
M.A. Stay |
Truth and Light: Physical Algorithmic Randomness |
08/2005 |
| 263 |
R. Pemantle and M.C. Wilson |
Twenty Combinatorial Examples of Asymptotics Derived From Multivariate
Generating Functions |
04/2005 |
| 308 |
M. Zimand |
Two Sources Are Better than One for Increasing the Kolmogorov
Complexity of Infinite Sequences |
05/2007 |
| 073 |
G. Paun |
Two-Level Distributed H Systems |
12/1997 |
| 075 |
P. Hertling (editor) |
Unconventional Models of Computation'98: Posters |
01/1998 |
| 048 |
R.G. Downey and A. Nies |
Undecidability Results for Low Complexity Degree
Structures |
08/1997 |
| 225 |
S. Daniels |
Uniform Candy Distribution |
10/2003 |
| 028 |
N. Brand and M. Morton |
Uniform Generalized Steinhaus Graphs |
02/1997 |
| 016 |
C.J. Colbourn and P.B. Gibbons |
Uniform Orthogonal Group Divisible Designs with Block Size
Three |
08/1996 |
| 164 |
R.G. Downey, D.R. Hirschfeldt and B. Khoussainov |
Uniformity in Computable Structure Theory |
11/2001 |
| 326 |
C.S. Calude, A. Nies, L. Staiger and F. Stephan |
Universal Recursively Enumerable Sets of Strings |
06/2008 |
| 300 |
N.J. Hay |
Universal Semimeasures: An Introduction |
02/2007 |
| 297 |
N.J. Hay, A. Shorin and J. Wang (editors) |
University of Auckland Computer Science Graduate Workshop
2006 |
01/2007 |
| 097 |
A.M. Kraegeloh |
Unstable Dynamics on a Markov Background and Stability in
Average |
03/1999 |
| 105 |
M.J. Dinneen and B. Khoussainov |
Update Games and Update Networks |
06/1999 |
| 127 |
M.J. Dinneen and B. Khoussainov |
Update Networks and Their Routing Strategies |
03/2000 |
| 103 |
B. Assanovich and U. Guenther |
Variable-Length Codes for Sources with Equiprobable
Symbols |
05/1999 |
| 265 |
M. Stay |
Very Simple Chaitin Machines for Concrete AIT |
05/2005 |
| 196 |
L. Staiger |
Weighted Finite Automata and Metrics in Cantor Space |
10/2002 |
| 183 |
K. Svozil |
What Could be More Practical than a Good Interpretation? |
05/2002 |
| 217 |
C.S. Calude, E. Calude and M.J. Dinneen |
What is the Value of Taxicab(6)? |
05/2003 |
| 261 |
C.S. Calude, E. Calude and M.J. Dinneen |
What is the Value of Taxicab(6)? An Update |
04/2005 |
| 143 |
C.S. Calude |
Who Is Afraid of Randomness? |
09/2000 |
| 165 |
D.S. Bridges, C.S. Calude and F. Kroon (editors) |
Workshop on Truths and Proofs |
11/2001 |
| 076 |
C. Martin-Vide, G. Paun, G. Rosenberg and A. Salomaa |
X-Families: An Approach to the Study of Families of Syntactically
Similar Languages |
01/1998 |
| 184 |
K. Svozil |
n-ary Quantum Information Defined by State Partitions |
05/2002 |
