Overview

Full Product Details

Author:   C.S. Calude ,  M.J. Dinneen ,  S. Sburlan ,  S. Sburlan (Ovidus University, Constanta, Romania)
Publisher:   Springer London Ltd
Imprint:   Springer London Ltd
Edition:   Softcover reprint of the original 1st ed. 2001
Dimensions:   Width: 15.50cm , Height: 1.40cm , Length: 23.50cm
Weight:   0.406kg
ISBN:  

9781852335267

ISBN 10:   1852335262
Pages:   251
Publication Date:   22 June 2001
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Invited papers.- Early Computer Science Adventures of a Mathematician.- Sequentially Continuity in Constructive Mathematics.- Recursive Functions: An Archeological Look.- The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity.- Contributed papers.- Some Results for Some Conjectures in Addition Chains.- A Highly Random Number.- Dini's Theorem: A Constructive Case Study.- Even Linear Simple Matrix Languages: Formal Language Aspects.- Pseudo-BCK Algebras: An Extension of BCK Algebras.- P-Immune Sets with Holes Lack Self-Reducibility Properties.- Lex Ideals of Generalized MV-Algebras.- Armstrong Systems on Ordered Sets.- Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings.- On Relax-ability of Word-Order by D-grammars.- On the Structure of Linear Cellular Automata.- Monotonically Computable Real Numbers.- Apartness as a Relation Between Subsets.- How Large is the Set of Disjunctive Sequences?.- A Loopless Generation of Bitstrings without p Consecutive Ones.- Greedy Algorithms for the Lower and Upper Chromatic Numbers.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions