Combinatorics, Computability and Logic: Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS’01)
C.S. Calude, M.J. Dinneen, S. Sburlan
Springer London, Jun 22, 2001 - Mathematics - 251 pages
The third Discrete Mathematics and Theoretical Computer Science conference (DMTCS'OI) of the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland has been organised at the Faculty of Math ematics and Computer Science, "Ovidius" University, Constan~a, Romania, with the co-operation of the Maritime Academy "Mircea eel Batran", Constan~a. It was held held in the beautiful Romanian city of Constan~a on the Black Sea. The conference was dedicated to Professor Frank Harary on the occasion of his 80th Birthday. The four invited speakers of the conference were: F. Harary (New Mexico State University, USA), H. Ishihara (Jaist, Japan), P. Odifreddi (Thrin Univer sity, Italy), 1. Tomescu (Bucharest University, Romania). The Programme Committee consisting of C.S. Calude (Chair, Auckland), C. Ding (Hong Kong), M.J. Dinneen (Secretary, Auckland), M.R. Fellows (Victo ria, Canada), M. Hallett (Zurich), M. Ito (Kyoto), S. Istrail (Rockville, USA), K-W. Lih (Taipei), S. Marcus (Bucharest), Y. Matiyasevich (St. Petersburg), Gh. Paun (Bucharest), S. Rudeanu (Bucharest), J. Rutten (Amsterdam), K.
What people are saying - Write a review
We haven't found any reviews in the usual places.
10 other sections not shown
Other editions - View all
addition chain Armstrong system axioms Banach space binary bipartite graph bitstrings bounded pseudo-BCK algebra C-edges called Calude Cantor space cellular automata Chaitin color complete join-semilattice complete lattice computable real numbers computable sequence Computer Science conjecture constructive contains converges Corollary corresponding define Definition denote digraphs Dini's theorem disjunctive DR-tree edge endif enumerable equivalent ESL(n exists finite GMV-algebra grammar graph G graph theory Gray code greatest element greedoid halts Hence hypergraph ideals implies infinite integer join-semilattice lattice-ordered Lemma linear mapping Logic Math Mathematics maximum matching metric space monotonically computable node notion obtain oracle ordered set output P-immune Proof properties Proposition prove pseudo-MV algebra random rational numbers relation result right-pseudo-BL algebra satisfies self-reducible sequentially continuous shortest addition chain simulation string subset symbol Theorem theory Turing machine unicycle uniquely restricted University vertex vertices w-languages witness interval x o y Z-group