The Process Complexity and the Understanding of Sequences. - Robert P. Daley (MFCS, 1973)

An Example of Information and Computation Resource Trade-Off. - Robert P. Daley (J. ACM, 1973)

Minimal-Program Complexity of Sequences with Restricted Resources - Robert P. Daley (Inf. Control., 1973)

Non-Complex Sequences: Characterizations and Examples - Robert P. Daley (SWAT, 1974)

The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies. - Robert P. Daley (J. Comput. Syst. Sci., 1974)

Minimal-Program Complexity of Pseudo-Recursive and Pseudo-Random Sequences. - Robert P. Daley (Math. Syst. Theory, 1975)

Noncomplex Sequences: Characterizations and Examples. - Robert P. Daley (J. Symb. Log., 1976)

On the Inference of Optimal Descriptions. - Robert P. Daley (Theor. Comput. Sci., 1977)

On the Simplicity of Busy Beaver Sets. - Robert P. Daley (Math. Log. Q., 1978)

On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. - Robert P. Daley (MFCS, 1979)

Quantitative and Qualitative Information in Computations - Robert P. Daley (Inf. Control., 1980)

On the Error Correcting Power of Pluralism in Inductive Inference. - Robert P. Daley (FCT, 1981)

Retraceability, Repleteness and Busy Beaver Sets. - Robert P. Daley (MFCS, 1981)

Busy Beaver Sets and the Degrees of Unsolvability. - Robert P. Daley (J. Symb. Log., 1981)

Busy Beaver Sets: Characterizations and Applications - Robert P. Daley (Inf. Control., 1982)

On the Error Correcting Power of Pluralism in BC-Type Inductive Inference. - Robert P. Daley (Theor. Comput. Sci., 1983)

On the Complexity of Inductive Inference (Preliminary Report). - Robert P. Daley; Carl H. Smith (MFCS, 1984)

On the complextiy of inductive inference. - Robert P. Daley; Carl H. Smith (Bull. EATCS, 1984)

Inductive inference hierarchies: probabilistic vs pluralistic strategies. - Robert P. Daley (Mathematical Methods of Specification and Synthesis of Software Systems, 1985)

Using the Algorithm of Analogy for Generation of Robot Programs. - Robert P. Daley (AII, 1986)

Towards the Development of an Analysis of Learning Algorithms (Invited Key Note). - Robert P. Daley (AII, 1986)

On the Complexity of Inductive Inference - Robert P. Daley; Carl H. Smith (Inf. Control., 1986)

Transformation of Probabilistic Learning Strategies into Deterministic Learning Strategies. - Robert P. Daley (COLT, 1988)

Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). - Robert P. Daley; Leonard Pitt; Mahendran Velauthapillai; Todd Will (COLT, 1991)

Multi-Agent Learning: Theoretical and Empirical Studies. - Robert P. Daley (Nonmonotonic and Inductive Logic, 1991)

The Power of Probabilism in Popperian FINite Learning (extended abstract). - Robert P. Daley; Bala Kalyanasundaram; Mahendran Velauthapillai (AII, 1992)

Breaking the Probability 1/2 Barrier in FIN-Type Learning. - Robert P. Daley; Bala Kalyanasundaram; Mahendran Velauthapillai (COLT, 1992)

Probabilistic and Pluralistic Learners with Mind Changes. - Robert P. Daley; Bala Kalyanasundaram (MFCS, 1992)

Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. - Robert P. Daley; Bala Kalyanasundaram (ALT, 1993)

Capabilities of Probabilistic Learners with Bounded Mind Changes. - Robert P. Daley; Bala Kalyanasundaram (COLT, 1993)

Capabilities of fallible FINite Learning. - Robert P. Daley; Bala Kalyanasundaram; Mahendran Velauthapillai (COLT, 1993)

The power of probabilism in Popperian FINite learning. - Robert P. Daley; Bala Kalyanasundaram; Mahe Velauthapillai (J. Exp. Theor. Artif. Intell., 1994)

Towards Reduction Argumentf for FINite Learning. - Robert P. Daley; Bala Kalyanasundaram (GOSLER Final Report, 1995)

Breaking the Probability 1/2 Barrier in FIN-Type Learning. - Robert P. Daley; Bala Kalyanasundaram; Mahendran Velauthapillai (J. Comput. Syst. Sci., 1995)

FINite Learning Capabilities and Their Limits. - Robert P. Daley; Bala Kalyanasundaram (COLT, 1997)