Cristian S. Calude

Christine Müller

Proceedings of the Intelligent Computer Mathematics, 2009

2008

Foreword.

[BibT_eX]

[DOI]

Nat. Comput., 2008

Most programs stop quickly or never halt.

[BibT_eX]

[DOI]

Michael A. Stay

Adv. Appl. Math., 2008

Incompleteness: A Personal Perspective.

[BibT_eX]

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

Preface.

[BibT_eX]

[DOI]

Mark Burgin

Theor. Comput. Sci., 2007

Preface.

[BibT_eX]

[DOI]

Rossella Lupacchini

Giorgio Sandri

Nat. Comput., 2007

Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu.

[BibT_eX]

[DOI]

Gheorghe Stefanescu

J. Univers. Comput. Sci., 2007

Exact Approximations of omega Numbers.

[BibT_eX]

[DOI]

Int. J. Bifurc. Chaos, 2007

2006

A New Measure of the Difficulty of Problems.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2006

Natural halting probabilities, partial randomness, and zeta functions.

[BibT_eX]

[DOI]

Michael Stay

Inf. Comput., 2006

Automata Recognizing No Words: A Statistical Approach.

[BibT_eX]

[DOI]

Cezar Câmpeanu

Monica Dumitrescu

Fundam. Informaticae, 2006

On partial randomness.

[BibT_eX]

[DOI]

Ludwig Staiger

Sebastiaan Terwijn

Ann. Pure Appl. Log., 2006

2005

Generalisations of disjunctive sequences.

[BibT_eX]

[DOI]

Ludwig Staiger

Math. Log. Q., 2005

Constructivity, Computability, and Logic A Collection of Papers in Honour of the 60th Birthday of Douglas Bridges.

[BibT_eX]

[DOI]

Hajime Ishihara

J. Univers. Comput. Sci., 2005

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Proving as a Computable Procedure.

[BibT_eX]

[DOI]

Sergiu Rudeanu

Fundam. Informaticae, 2005

Contagious Creativity.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Fundam. Informaticae, 2005

Is complexity a source of incompleteness?

[BibT_eX]

[DOI]

Helmut Jürgensen

Adv. Appl. Math., 2005

2004

A fast natural algorithm for searching.

[BibT_eX]

[DOI]

Joshua J. Arulanandham

Theor. Comput. Sci., 2004

Passages of Proof.

[BibT_eX]

Solomon Marcus

Bull. EATCS, 2004

Algorithmic Randomness, Quantum Physics, and Incompleteness.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Mathematical Proofs at a Crossroad?

[BibT_eX]

[DOI]

Solomon Marcus

Proceedings of the Theory Is Forever, 2004

Balance Machines: Computing = Balancing.

[BibT_eX]

[DOI]

Joshua J. Arulanandham

Proceedings of the Aspects of Molecular Computing, 2004

2003

What is the Value of Taxicab(6)?

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2003

A topological characterization of random sequences.

[BibT_eX]

[DOI]

Solomon Marcus

Ludwig Staiger

Inf. Process. Lett., 2003

2002

Information and Randomness - An Algorithmic Perspective

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04978-5, 2002

Chaitin Omega numbers, Solovay machines, and Gödel incompleteness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

A characterization of c.e. random reals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Coins, Quantum Measurements, and Turing's Barrier.

[BibT_eX]

[DOI]

Boris S. Pavlov

Quantum Inf. Process., 2002

Incompleteness, Complexity, Randomness and Beyond.

[BibT_eX]

[DOI]

Minds Mach., 2002

Additive Distances and Quasi-Distances Between Words.

[BibT_eX]

[DOI]

Kai Salomaa

J. Univers. Comput. Sci., 2002

Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue.

[BibT_eX]

[DOI]

Kai Salomaa

J. Univers. Comput. Sci., 2002

Computing a Glimpse of Randomness.

[BibT_eX]

[DOI]

Chi-Kou Shu

Exp. Math., 2002

The Bridge Crossing Problem.

[BibT_eX]

Bull. EATCS, 2002

Bead-Sort: A Natural Sorting Algorithm.

[BibT_eX]

Joshua J. Arulanandham

Bull. EATCS, 2002

Entropic measures, Markov information sources and complexity.

[BibT_eX]

[DOI]

Monica Dumitrescu

Appl. Math. Comput., 2002

2001

Recursively enumerable reals and Chaitin Omega numbers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Coding with Minimal Programs.

[BibT_eX]

[DOI]

Hajime Ishihara

Takeshi Yamaguchi

Int. J. Found. Comput. Sci., 2001

Automata: From Uncertainty to Quantum.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Computational complementarity for probabilistic automata.

[BibT_eX]

Karl Svozil

Proceedings of the Where Mathematics, 2001

Liars, Demons, and Chaos.

[BibT_eX]

Peter Kay

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

Finite nondeterministic automata: Simulation and minimality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Automata, Logic, and Computability: J.UCS Special Issue Dedicated to Professor Sergiu Rudeanu Festschrift.

[BibT_eX]

[DOI]

Gheorghe Stefanescu

J. Univers. Comput. Sci., 2000

Computing with cells and atoms in a nutshell.

[BibT_eX]

[DOI]

Complex., 2000

Reflections on quantum computing.

[BibT_eX]

[DOI]

Karl Svozil

Complex., 2000

Quantum Correlations Conundrum: An Automata-Theoretic Approach.

[BibT_eX]

Karl Svozil

Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

Solving Problems with Finite Test Sets.

[BibT_eX]

[DOI]

Helmut Jürgensen

Shane Legg

Proceedings of the Finite Versus Infinite, 2000

1999

Metric Lexical Analysis.

[BibT_eX]

[DOI]

Kai Salomaa

Proceedings of the Automata Implementation, 1999

Bisimulations and behaviour of nondeterministic automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

Program-Size Complexity of Initial Segments and Domination Reducibility.

[BibT_eX]

Richard J. Coles

Proceedings of the Jewels are Forever, 1999

1998

Computable Approximations of Reals: An Information-Theoretic Analysis.

[BibT_eX]

[DOI]

Peter Hertling

Fundam. Informaticae, 1998

Computational Complementarity for Mealy Automata.

[BibT_eX]

Catalina Stefanescu

Bull. EATCS, 1998

Introduction to unconventional models of computation.

[BibT_eX]

[DOI]

John L. Casti

Complex., 1998

Computational Complementarity and Sofic Shifts.

[BibT_eX]

Marjo Lipponen

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997

Complexity: A Language-Theoretic Point of View.

[BibT_eX]

[DOI]

Juraj Hromkovic

Proceedings of the Handbook of Formal Languages, 1997

Optimum Extendible Prefix Codes.

[BibT_eX]

[DOI]

Ioan Tomescu

J. Univers. Comput. Sci., 1997

Chaitin Omega Numbers and Strong Reducibilities.

[BibT_eX]

[DOI]

André Nies

J. Univers. Comput. Sci., 1997

Logic in Computer Science.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1997

Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?

[BibT_eX]

Peter Hertling

Bull. EATCS, 1997

Language-theoretic Complexity of Disjunctive Sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

A genius's story: Two books on Gödel.

[BibT_eX]

[DOI]

Complex., 1997

Deterministic Automata: Simulation, Universality and Minimality.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1997

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Effects of Kolmogorov Complexity Present in Inductive Inference as Well.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996

Effective Category and Measure in Abstract Complexity Theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Kraft-Chaitin Inequality Revisited.

[BibT_eX]

[DOI]

Cristian Grozes

J. Univers. Comput. Sci., 1996

Algorithmic Information Theory: Open Problems.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1996

The Finite, The Unbounded and The Infinite.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1996

Are binary codings universal?

[BibT_eX]

[DOI]

Cezar Câmpeanu

Complex., 1996

1995

What Is a Random String?

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Program-size Complexity Computes the Halting Problem.

[BibT_eX]

Gregory J. Chaitin

Asat Arslanov

Bull. EATCS, 1995

Effective Category and Measure in Abstract Complexity Theory (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Information and Randomness - An Algorithmic Perspective

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science, Springer, ISBN: 978-3-662-03049-3, 1994

On Recursive Bounds for the Exceptional Values in Speed-Up.

[BibT_eX]

[DOI]

Douglas S. Bridges

Theor. Comput. Sci., 1994

Journal of Universal Computer Science.

[BibT_eX]

[DOI]

Hermann A. Maurer

Arto Salomaa

J. Univers. Comput. Sci., 1994

Three Theories of Computational Complexity Extended Abstract.

[BibT_eX]

Monica Tataram

Sci. Ann. Cuza Univ., 1994

Randomness as an Invariant for Number Representations.

[BibT_eX]

[DOI]

Helmut Jürgensen

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Pocket Mathematics.

[BibT_eX]

[DOI]

Hermann Maurer

Proceedings of the Mathematical Aspects of Natural and Formal Languages, 1994

1993

Note on the Topological Structure of Random Strings.

[BibT_eX]

[DOI]

Cezar Câmpeanu

Theor. Comput. Sci., 1993

Algorithmically Coding the Universe.

[BibT_eX]

Arto Salomaa

Proceedings of the Developments in Language Theory, 1993

Borel Normality and Algorithmic Randomness.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1992

Recursive Baire Classification and Speedable Functions.

[BibT_eX]

[DOI]

Gabriel Istrate

Math. Log. Q., 1992

1991

Determining and Stationary Sets for Some Classes of Partial Recursive Functions.

[BibT_eX]

[DOI]

Gabriel Istrate

Theor. Comput. Sci., 1991

Relativized Topological Size of Sets of Partial Recursive Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

1990

On a theorem of Günter Asser.

[BibT_eX]

[DOI]

Lila Santean

Math. Log. Q., 1990

1989

Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A Constructive Glimpse.

[BibT_eX]

[DOI]

Dragos Vaida

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1987

Super-Exponentials Nonprimitive Recursive, but Rudimentary.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

1986

Note on Ehrenfeucht's conjecture and Hilbert's basis theorem.

[BibT_eX]

Bull. EATCS, 1986

1984

A class of nuniversal P Marti-Löf tests.

[BibT_eX]

Ion Chitescu

Bull. EATCS, 1984

1983

On a class of independent problems related to Rice theorem.

[BibT_eX]

[DOI]

SIGACT News, 1983

Representability of recursive P. Martin-Löf tests.

[BibT_eX]

[DOI]

Ion Chitescu

Kybernetika, 1983

On representability of P. Martin-Löf tests.

[BibT_eX]

[DOI]

Ion Chitescu

Kybernetika, 1983

Independent Instances for Some Undecidable Problems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1983

1982

Topological Size of Sets of Partial Recursive Functions.

[BibT_eX]

[DOI]

Math. Log. Q., 1982

1981

Global syntax and semantics for recursively enumerable languages.

[BibT_eX]

Fundam. Informaticae, 1981

1979

On topologies generated by Moisil resemblance relations.

[BibT_eX]

[DOI]

Virgil Emil Cazanescu

Discret. Math., 1979

1976

On metrizability of the free monoids.

[BibT_eX]

[DOI]