Recursive inset entropies of multiplicative type on open domains.

Pl. Kannappan; B.R. Ebanks; C.T. Ng

Displaying similar documents to “Recursive inset entropies of multiplicative type on open domains.”

A recursive construction of asymmetric 1-factorisations.

B.A. Anderson, M.M. Barge, D. Morse (1977)

Aequationes mathematicae

Similarity:

The fundamental equation of information and its generalizations.

Wolfgang Sander (1987)

Aequationes mathematicae

Similarity:

Characterizations of sum form information measures on open domains.

B.R. Ebanks, P.K. Sahoo, P. Kannappan (1997)

Aequationes mathematicae

Similarity:

Branching inset entropies on open domains.

B.R. Ebanks (1990)

Aequationes mathematicae

Similarity:

Measures of inset information on the open domain - I: Inset entropies and information functions of all degrees.

B.R. Ebanks, Gy. Maska (1986)

Aequationes mathematicae

Similarity:

Recursive families of sets

S. Mrówka (1957)

Fundamenta Mathematicae

Similarity:

CONTENTS Foreword.......................................................................................... 3 I. Recursive and computable numbers...................................... 4 1. Recursive numbers................................................................... 5 2. Computable numbers............................................................... 17 II. Recursive and computable sequences................................. 22 III. Recursive and computable functionals....................................

Notation systems and recursive ordered fields

Yiannis N. Moschovakis (1965-1966)

Compositio Mathematica

Similarity:

Recursiveness of initial segments of Kleene's O

Carl Jockusch (1975)

Fundamenta Mathematicae

Similarity:

Quantification of number-theoretic functions

S. C. Kleene (1959-1960)

Compositio Mathematica

Similarity: