# Chaitin's constant

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- Advances in Engineering Software
- 2014

This work proposes a new meta-heuristic called Grey Wolf Optimizer (GWO) inspired by grey wolves (Canis lupus). The GWO algorithm… (More)

Is this relevant?

2005

2005

- J. Mathematical Logic
- 2005

As a natural example of a 1-random real, Chaitin proposed the halting probability Ω of a universal prefix-free machine. We can… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- ArXiv
- 2002

We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- SIAM Review
- 2002

Interior methods are an omnipresent, conspicuous feature of the constrained optimization landscape today, but it was not always… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- 1998

A real is called recursively enumerable if it is the limit of a recursive, increasing, converging sequence of rationals… (More)

Is this relevant?

1997

1997

- 1997

We prove that any Chaitin Ω number (i.e., the halting probability of a universal self-delimiting Turing machine) is wtt-complete… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Machine Translation
- 1989

Title Type words in the mind an introduction to the mental lexicon PDF science terms made easy vol 1 a lexicon of scientific… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- FOCS
- 1988

Automata on infinite words were introduced by Biichi in order to give a decision procedure for SlS, the monadic second-order… (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Theoretical Computer Science
- 1981

The paper is concerned with ways in which fair concurrency can be modelled using notations for omega-regular languages languages… (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- IEEE Transactions on Computers
- 1975

This paper discusses the design of a primary memory system for an array processor which allows parallel, conflict-free access to… (More)

Is this relevant?