default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert P. Daley
Person information
- affiliation: MIT, Cambridge, US
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[c20]Robert P. Daley, Bala Kalyanasundaram:
FINite Learning Capabilities and Their Limits. COLT 1997: 81-89- 1995
- [j15]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
Breaking the Probability 1/2 Barrier in FIN-Type Learning. J. Comput. Syst. Sci. 50(3): 574-599 (1995) - [c19]Robert P. Daley, Bala Kalyanasundaram:
Towards Reduction Argumentf for FINite Learning. GOSLER Final Report 1995: 63-75 - 1994
- [j14]Robert P. Daley, Bala Kalyanasundaram, Mahe Velauthapillai:
The power of probabilism in Popperian FINite learning. J. Exp. Theor. Artif. Intell. 6(1): 41-62 (1994) - 1993
- [c18]Robert P. Daley, Bala Kalyanasundaram:
Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. ALT 1993: 173-186 - [c17]Robert P. Daley, Bala Kalyanasundaram:
Capabilities of Probabilistic Learners with Bounded Mind Changes. COLT 1993: 182-191 - [c16]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
Capabilities of fallible FINite Learning. COLT 1993: 199-208 - 1992
- [c15]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
The Power of Probabilism in Popperian FINite Learning (extended abstract). AII 1992: 151-169 - [c14]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
Breaking the Probability 1/2 Barrier in FIN-Type Learning. COLT 1992: 203-217 - [c13]Robert P. Daley, Bala Kalyanasundaram:
Probabilistic and Pluralistic Learners with Mind Changes. MFCS 1992: 218-226 - 1991
- [c12]Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will:
Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). COLT 1991: 228-239 - [c11]Robert P. Daley:
Multi-Agent Learning: Theoretical and Empirical Studies. Nonmonotonic and Inductive Logic 1991: 175-183
1980 – 1989
- 1988
- [c10]Robert P. Daley:
Transformation of Probabilistic Learning Strategies into Deterministic Learning Strategies. COLT 1988: 220-226 - 1986
- [j13]Robert P. Daley, Carl H. Smith:
On the Complexity of Inductive Inference. Inf. Control. 69(1-3): 12-40 (1986) - [c9]Robert P. Daley:
Towards the Development of an Analysis of Learning Algorithms (Invited Key Note). AII 1986: 1-18 - [c8]Robert P. Daley:
Using the Algorithm of Analogy for Generation of Robot Programs. AII 1986: 19-22 - 1985
- [c7]Robert P. Daley:
Inductive inference hierarchies: probabilistic vs pluralistic strategies. Mathematical Methods of Specification and Synthesis of Software Systems 1985: 73-82 - 1984
- [j12]Robert P. Daley, Carl H. Smith:
On the complextiy of inductive inference. Bull. EATCS 23: 22-27 (1984) - [c6]Robert P. Daley, Carl H. Smith:
On the Complexity of Inductive Inference (Preliminary Report). MFCS 1984: 255-264 - 1983
- [j11]Robert P. Daley:
On the Error Correcting Power of Pluralism in BC-Type Inductive Inference. Theor. Comput. Sci. 24: 95-104 (1983) - 1982
- [j10]Robert P. Daley:
Busy Beaver Sets: Characterizations and Applications. Inf. Control. 52(1): 52-67 (1982) - 1981
- [j9]Robert P. Daley:
Busy Beaver Sets and the Degrees of Unsolvability. J. Symb. Log. 46(3): 460-474 (1981) - [c5]Robert P. Daley:
On the Error Correcting Power of Pluralism in Inductive Inference. FCT 1981: 90-99 - [c4]Robert P. Daley:
Retraceability, Repleteness and Busy Beaver Sets. MFCS 1981: 252-261 - 1980
- [j8]Robert P. Daley:
Quantitative and Qualitative Information in Computations. Inf. Control. 45(3): 236-244 (1980)
1970 – 1979
- 1979
- [c3]Robert P. Daley:
On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. MFCS 1979: 258-265 - 1978
- [j7]Robert P. Daley:
On the Simplicity of Busy Beaver Sets. Math. Log. Q. 24(13-14): 207-224 (1978) - 1977
- [j6]Robert P. Daley:
On the Inference of Optimal Descriptions. Theor. Comput. Sci. 4(3): 301-319 (1977) - 1976
- [j5]Robert P. Daley:
Noncomplex Sequences: Characterizations and Examples. J. Symb. Log. 41(3): 626-638 (1976) - 1975
- [j4]Robert P. Daley:
Minimal-Program Complexity of Pseudo-Recursive and Pseudo-Random Sequences. Math. Syst. Theory 9(1): 83-94 (1975) - 1974
- [j3]Robert P. Daley:
The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies. J. Comput. Syst. Sci. 9(2): 151-163 (1974) - [c2]Robert P. Daley:
Non-Complex Sequences: Characterizations and Examples. SWAT 1974: 165-169 - 1973
- [j2]Robert P. Daley:
Minimal-Program Complexity of Sequences with Restricted Resources. Inf. Control. 23(4): 301-312 (1973) - [j1]Robert P. Daley:
An Example of Information and Computation Resource Trade-Off. J. ACM 20(4): 687-695 (1973) - [c1]Robert P. Daley:
The Process Complexity and the Understanding of Sequences. MFCS 1973: 215-218
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
