Samuel E. Moelius III My research interests include: computability theory, program self-reference, learning theory, and computer security. In May 2009, I completed my Ph.D. under the supervision of Dr. John Case. (My thesis can be found below.) I now work for the IDA Center for Computing Sciences in Bowie, Maryland.

Publications

• S. Moelius and S. Zilles. Learning without Coding. In Proceedings of 21st International Conference on Algorithmic Learning Theory (ALT'10), volume 6331 of Lecture Notes in Artificial Intelligence, pages 300-314, 2010.
  
  
• J. Case and S. Moelius. Characterizing Programming Systems Allowing Program Self-Reference. Theory of Computing Systems, 45(4):756-772, 2009.
  • Appeared originally in Proceedings of Computation and Logic in the Real World - Third Conference of Computability in Europe (CiE'07), volume 4497 of Lecture Notes in Computer Science, pages 125-134, 2007.
    
    
• J. Case and S. Moelius. Independence Results for n-Ary Recursion Theorems. In Proceedings of 17th International Symposium on Fundamentals of Computation Theory (FCT'09), volume 5699 of Lecture Notes in Computer Science, pages 38-49, 2009.
  • Expanded version: nary_rt_tr.pdf. July 13, 2009. (Contains complete proofs of all theorems.)
    
    
• J. Case and S. Moelius. Program Self-Reference in Constructive Scott Subdomains. In Proceedings of Mathematical Theory and Computational Practice - Third Conference of Computability in Europe (CiE'09), volume 5635 of Lecture Notes in Computer Science, pages 89-98, 2009.
  • Expanded version: krt_css_tr.pdf. July 13, 2009. (Contains complete proofs of all theorems.)
    
    
• S. Moelius. Program Self-Reference. Ph.D. thesis, University of Delaware, 2009. dissertation.pdf.
  
  
• J. Case and S. Moelius. Parallelism Increases Iterative Learning Power. Theoretical Computer Science, 410(19):1863-1875, 2009.
  • Appeared originally in Proceedings of 18th International Conference on Algorithmic Learning Theory (ALT'07), volume 4754 of Lecture Notes in Artificial Intelligence, pages 49-63, 2007.
    
    
• J. Case and S. Moelius. Optimal Language Learning. In Proceedings of 19th International Conference on Algorithmic Learning Theory (ALT'08), volume 5254 of Lecture Notes in Artificial Intelligence, pages 419-433, 2008.
  • Expanded version: opt_lang_tr.pdf. July 26, 2008. (Contains complete proofs of all theorems.)
    
    
• S. Lange, S. Moelius, and S. Zilles. Learning with Temporary Memory. In Proceedings of 19th International Conference on Algorithmic Learning Theory (ALT'08), volume 5254 of Lecture Notes in Artificial Intelligence, pages 449-463, 2008.
  • Expanded version: tem_tr.pdf. July 26, 2008. (Contains complete proofs of all theorems.)
    
    
• J. Case and S. Moelius. U-shaped, iterative, and iterative-with-counter learning. Machine Learning, 72(1-2):63-88, 2008.
  • Appeared originally in Proceedings of the 20th Annual Conference on Learning Theory (COLT'07), volume 4539 of Lecture Notes in Artificial Intelligence, pages 172-186, 2007.
  • Expanded version: iteqnuit_mlj_preprint.pdf. August 31, 2007. (This is a preprint of the journal version. Contains complete proofs of all theorems.)
    
    
• J. Case and S. Moelius. Properties Complementary to Program Self-reference. In Proceedings of 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS'07), volume 4708 of Lecture Notes in Computer Science, pages 253-263, 2007.
  • Expanded version: epit_mfcs_preprint.pdf. April 7, 2007. (This is a preprint of the conference version. Contains complete proofs of all theorems.)
    
    
• J. Case and S. Moelius. Cautious virus detection in the extreme. In Proceedings of 2007 ACM SIGPLAN Workshop on Programming Languages and Analysis for Security (PLAS'07), pages 47-51, 2007.
  
  

Fun & Games

Other