Home
Scholarly Works
The Omega Number: Irreducible Complexity in Pure...
Conference

The Omega Number: Irreducible Complexity in Pure Math.

Authors

Chaitin GJ

Editors

Borwein JM; Farmer WM

Series

Lecture Notes in Computer Science

Volume

4108

Pagination

pp. 1-1

Publisher

Springer

Publication Date

January 1, 2006

ISBN-10

3-540-37104-4

Conference proceedings

MKM

Contact the Experts team