Robert P. Daley

Publication Activity (10 Years)

Years Active: 1973-1997
Publications (10 Years): 0

Publications

Robert P. Daley, Bala Kalyanasundaram
FINite Learning Capabilities and Their Limits. COLT (1997)
Robert P. Daley, Bala Kalyanasundaram
Towards Reduction Argumentf for FINite Learning. GOSLER Final Report (1995)
Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Breaking the Probability 1/2 Barrier in FIN-Type Learning. J. Comput. Syst. Sci. 50 (3) (1995)
Robert P. Daley, Bala Kalyanasundaram, Mahe Velauthapillai
The power of probabilism in Popperian FINite learning. J. Exp. Theor. Artif. Intell. 6 (1) (1994)
Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Capabilities of fallible FINite Learning. COLT (1993)
Robert P. Daley, Bala Kalyanasundaram
Capabilities of Probabilistic Learners with Bounded Mind Changes. COLT (1993)
Robert P. Daley, Bala Kalyanasundaram
Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. ALT (1993)
Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
The Power of Probabilism in Popperian FINite Learning (extended abstract). AII (1992)
Robert P. Daley, Bala Kalyanasundaram
Probabilistic and Pluralistic Learners with Mind Changes. MFCS (1992)
Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Barrier in FIN-Type Learning. COLT (1992)
Robert P. Daley
Multi-Agent Learning: Theoretical and Empirical Studies. Nonmonotonic and Inductive Logic (1991)
Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will
Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). COLT (1991)
Robert P. Daley
Transformation of Probabilistic Learning Strategies into Deterministic Learning Strategies. COLT (1988)
Robert P. Daley
Towards the Development of an Analysis of Learning Algorithms (Invited Key Note). AII (1986)
Robert P. Daley
Using the Algorithm of Analogy for Generation of Robot Programs. AII (1986)
Robert P. Daley, Carl H. Smith
On the Complexity of Inductive Inference Inf. Control. 69 (1-3) (1986)
Robert P. Daley
Inductive inference hierarchies: probabilistic vs pluralistic strategies. Mathematical Methods of Specification and Synthesis of Software Systems (1985)
Robert P. Daley, Carl H. Smith
On the Complexity of Inductive Inference (Preliminary Report). MFCS (1984)
Robert P. Daley, Carl H. Smith
On the complextiy of inductive inference. Bull. EATCS 23 (1984)
Robert P. Daley
On the Error Correcting Power of Pluralism in BC-Type Inductive Inference. Theor. Comput. Sci. 24 (1983)
Robert P. Daley
Busy Beaver Sets: Characterizations and Applications Inf. Control. 52 (1) (1982)
Robert P. Daley
Busy Beaver Sets and the Degrees of Unsolvability. J. Symb. Log. 46 (3) (1981)
Robert P. Daley
Retraceability, Repleteness and Busy Beaver Sets. MFCS (1981)
Robert P. Daley
On the Error Correcting Power of Pluralism in Inductive Inference. FCT (1981)
Robert P. Daley
Quantitative and Qualitative Information in Computations Inf. Control. 45 (3) (1980)
Robert P. Daley
On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. MFCS (1979)
Robert P. Daley
On the Simplicity of Busy Beaver Sets. Math. Log. Q. 24 (13-14) (1978)
Robert P. Daley
On the Inference of Optimal Descriptions. Theor. Comput. Sci. 4 (3) (1977)
Robert P. Daley
Noncomplex Sequences: Characterizations and Examples. J. Symb. Log. 41 (3) (1976)
Robert P. Daley
Minimal-Program Complexity of Pseudo-Recursive and Pseudo-Random Sequences. Math. Syst. Theory 9 (1) (1975)
Robert P. Daley
The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies. J. Comput. Syst. Sci. 9 (2) (1974)
Robert P. Daley
Non-Complex Sequences: Characterizations and Examples SWAT (1974)
Robert P. Daley
An Example of Information and Computation Resource Trade-Off. J. ACM 20 (4) (1973)
Robert P. Daley
Minimal-Program Complexity of Sequences with Restricted Resources Inf. Control. 23 (4) (1973)
Robert P. Daley
The Process Complexity and the Understanding of Sequences. MFCS (1973)