Robert P. Daley - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

1997

FINite Learning Capabilities and Their LimitsRobert P. Daley, Bala Kalyanasundaram. colt 1997: 81-89 [doi]

1995

Breaking the Probability 1/2 Barrier in FIN-Type LearningRobert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai. jcss, 50(3):574-599, 1995.

Towards Reduction Argumentf for FINite LearningRobert P. Daley, Bala Kalyanasundaram. gosler 1995: 63-75

1994

The power of probabilism in Popperian FINite learningRobert P. Daley, Bala Kalyanasundaram, Mahe Velauthapillai. jetai, 6(1):41-62, 1994. [doi]

1993

Capabilities of Probabilistic Learners with Bounded Mind ChangesRobert P. Daley, Bala Kalyanasundaram. colt 1993: 182-191 [doi]

Use of Reduction Arguments in Determining Popperian FIN-Type Learning CapabilitiesRobert P. Daley, Bala Kalyanasundaram. alt 1993: 173-186

Capabilities of fallible FINite LearningRobert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai. colt 1993: 199-208 [doi]

1992

Probabilistic and Pluralistic Learners with Mind ChangesRobert P. Daley, Bala Kalyanasundaram. mfcs 1992: 218-226

The Power of Probabilism in Popperian FINite Learning (extended abstract)Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai. aii 1992: 151-169

Breaking the Probability ::::1/2:::: Barrier in FIN-Type LearningRobert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai. colt 1992: 203-217 [doi]

1991

Multi-Agent Learning: Theoretical and Empirical StudiesRobert P. Daley. nil 1993: 175-183

Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract)Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will. colt 1991: 228-239 [doi]

1988

Transformation of Probabilistic Learning Strategies into Deterministic Learning StrategiesRobert P. Daley. colt 1988: 220-226 [doi]

1986

Towards the Development of an Analysis of Learning Algorithms (Invited Key Note)Robert P. Daley. aii 1987: 1-18

Using the Algorithm of Analogy for Generation of Robot ProgramsRobert P. Daley. aii 1987: 19-22

On the Complexity of Inductive InferenceRobert P. Daley, Carl H. Smith. iandc, 69(1-3):12-40, April/May/June 1986.

1985

Inductive inference hierarchies: probabilistic vs pluralistic strategiesRobert P. Daley. aii 1986: 73-82

1984

On the Complexity of Inductive Inference (Preliminary Report)Robert P. Daley, Carl H. Smith. mfcs 1984: 255-264

On the complextiy of inductive inferenceRobert P. Daley, Carl H. Smith. eatcs, 23:22-27, 1984.

1983

On the Error Correcting Power of Pluralism in BC-Type Inductive InferenceRobert P. Daley. TCS, 24:95-104, 1983.

1982

Busy Beaver Sets: Characterizations and ApplicationsRobert P. Daley. iandc, 52(1):52-67, January 1982.

1981

Retraceability, Repleteness and Busy Beaver SetsRobert P. Daley. mfcs 1981: 252-261

On the Error Correcting Power of Pluralism in Inductive InferenceRobert P. Daley. fct 1981: 90-99

Busy Beaver Sets and the Degrees of UnsolvabilityRobert P. Daley. JSYML, 46(3):460-474, 1981.

1980

Quantitative and Qualitative Information in ComputationsRobert P. Daley. iandc, 45(3):236-244, June 1980.

1979

On the Simplification of Constructions in Degrees of Unsolvability via Computational ComplexityRobert P. Daley. mfcs 1979: 258-265

1978

On the Simplicity of Busy Beaver SetsRobert P. Daley. mlq, 24(13-14):207-224, 1978. [doi]

1977

On the Inference of Optimal DescriptionsRobert P. Daley. TCS, 4(3):301-319, 1977.

1976

Noncomplex Sequences: Characterizations and ExamplesRobert P. Daley. JSYML, 41(3):626-638, 1976.

1975

Minimal-Program Complexity of Pseudo-Recursive and Pseudo-Random SequencesRobert P. Daley. mst, 9(1):83-94, 1975.

1974

The Extent and Density of Sequences within the Minimal-Program Complexity HierarchiesRobert P. Daley. jcss, 9(2):151-163, 1974.

Non-Complex Sequences: Characterizations and ExamplesRobert P. Daley. focs 1974: 165-169

1973

Minimal-Program Complexity of Sequences with Restricted ResourcesRobert P. Daley. iandc, 23(4):301-312, November 1973.

The Process Complexity and the Understanding of SequencesRobert P. Daley. mfcs 1973: 215-218

An Example of Information and Computation Resource Trade-OffRobert P. Daley. JACM, 20(4):687-695, 1973. [doi]

Sign in or sign up to see more results.

runs on WebDSL