[1] Maguire P., Miller R., Moser P., and Maguire R. A robust house price index using sparse and frugal data. International Conference on Data Mining, New York, 2016. [ bib ]
[2] Maguire P., Kelly S., Miller R., Moser P., Maguire R., and Hyland P. Exploiting the low-volatility anomaly by optimizing historical portfolio volatility. International Conference on Data Mining, New York, 2016. [ bib ]
[3] Phil Maguire, Philippe Moser, and Rebecca Maguire. Understanding consciousness as data compression. Journal of Cognitive Science, 17(1):63-94, 2016. [ bib ]
[4] Philippe Moser. Polynomial depth, highness and lowness for E. Submitted, 2016. [ bib ]
[5] Philippe Moser and Frank Stephan. Depth, highness and DNR degrees. In Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, pages 81-94, 2015. [ bib | DOI | http ]
[6] Phil Maguire, Philippe Moser, and Rebecca Maguire. A clarification on Turing's test and its implications for machine intelligence. In Proceedings of the EuroAsianPacific Joint Conference on Cognitive Science / 4th European Conference on Cognitive Science / 11th International Conference on Cognitive Science, Torino, Italy, September 25-27, 2015., 2015. [ bib | .pdf ]
[7] Phil Maguire, Philippe Moser, Kieran O'Reilly, Conor McMenamin, Robert Kelly, and Rebecca Maguire. Maximizing positive porfolio diversification. In IEEE Conference on Computational Intelligence for Financial Engineering & Economics, CIFEr 2014, London, UK, March 27-28, 2014, pages 174-181, 2014. [ bib | DOI | http ]
[8] Phil Maguire, Philippe Moser, Rebecca Maguire, and Mark Keane. A mathematical theory of subjective probability. submitted to psych. review, 2014. [ bib | DOI | www: ]
[9] Phil Maguire, Philippe Moser, Kieran O‚ÄôReilly, Conor McMenamin, Rebecca Maguire, and Robert Kelly. Maximizing positive porfolio diversification. CIFER, London, 2014. [ bib | DOI | www: ]
[10] Simon Fuller, Phil Maguire, and Philippe Moser. A deep context grammatical model for authorship attribution. In Proceedings of the Ninth International Conference on Language Resources and Evaluation (LREC-2014), Reykjavik, Iceland, May 26-31, 2014., pages 4488-4492, 2014. [ bib | .html ]
[11] Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, and Philippe Moser. Dimension spectra of random subfractals of self-similar fractals. Ann. Pure Appl. Logic, 165(11):1707-1726, 2014. [ bib | DOI | http ]
[12] Phil Maguire, Philippe Moser, Rebecca Maguire, and Virgil Griffith. Is consciousness computable? quantifying integrated information using algorithmic information theory. 36th annual meeting of the Cognitive Science Society, Quebec, 2014. [ bib | http ]
[13] Phil Maguire, Philippe Moser, Rebecca Maguire, and Mark Keane. A computational theory of subjective probability. 35th annual meeting of the Cognitive Science Society, Berlin, 2013. [ bib | http ]
[14] Phil Maguire, Philippe Moser, J. McDonnell, R. Kelly, Simon Fuller, and Rebecca Maguire. A probabilistic risk-to-reward measure for evaluating the performance of financial securities. In Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, CIFEr 2013, IEEE Symposium Series on Computational Intelligence (SSCI), 16-19 April 2013, Singapore, pages 102-109, 2013. [ bib | DOI | http ]
[15] Philippe Moser. On the polynomial depth of various sets of random strings. Theor. Comput. Sci., 477:96-108, 2013. [ bib | DOI | http ]
[16] Jack Lutz, Elvira Mayordomo, and Philippe Moser. Dimension spectra of random sub-fractals of self-similar fractals. 8th Conference in Computability and Complexity in Analysis, Cambridge, 2012. [ bib | DOI | www: ]
[17] Phil Maguire, Donal O'Sullivan, Philippe Moser, and Gavin Dunne. Risk-adjusted portfolio optimisation using a parallel multi-objective evolutionary algorithm. In Proceedings of the 2012 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, CIFEr 2012, New York City, NY, USA, March 29-30, 2012, pages 1-8, 2012. [ bib | DOI | http ]
[18] Philippe Moser. A zero-one subexp-dimension law for BPP. CoRR, abs/1101.4848, 2011. [ bib | http ]
[19] Philippe Moser. On the polynomial depth of various sets of random strings. In Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings, pages 517-527, 2011. [ bib | DOI | http ]
[20] Elvira Mayordomo, Philippe Moser, and Sylvain Perifel. Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable. Theory Comput. Syst., 48(4):731-766, 2011. [ bib | DOI | http ]
[21] Philippe Moser. A zero-one subexp-dimension law for BPP. Inf. Process. Lett., 111(9):429-432, 2011. [ bib | DOI | http ]
[22] Philippe Moser. On the polynomial depth of various sets of random strings. CoRR, abs/1012.3548, 2010. [ bib | http ]
[23] Philippe Moser. On the convergence of Fourier series of computable Lebesgue integrable functions. Math. Log. Q., 56(5):461-469, 2010. [ bib | DOI | http ]
[24] Elvira Mayordomo, Philippe Moser, and Sylvain Perifel. Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable. CoRR, abs/0903.4101, 2009. [ bib | http ]
[25] Russell Impagliazzo and Philippe Moser. A zero-one law for RP and derandomization of AM if NP is not small. Inf. Comput., 207(7):787-792, 2009. [ bib | DOI | http ]
[26] Elvira Mayordomo and Philippe Moser. Polylog space compression is incomparable with Lempel-Ziv and pushdown compression. In SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings, pages 633-644, 2009. [ bib | DOI | http ]
[27] Philippe Moser. A general notion of useful information. In Proceedings International Workshop on The Complexity of Simple Programs, CSP 2008, Cork, Ireland, 6-7th December 2008., pages 164-171, 2008. [ bib | http ]
[28] Pilar Albert, Elvira Mayordomo, Philippe Moser, and Sylvain Perifel. Pushdown compression. In STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pages 39-48, 2008. [ bib | DOI | http ]
[29] Philippe Moser. Generic density and small span theorem. Inf. Comput., 206(1):1-14, 2008. [ bib | DOI | http ]
[30] Philippe Moser. Resource-bounded measure on probabilistic classes. Inf. Process. Lett., 106(6):241-245, 2008. [ bib | DOI | http ]
[31] Philippe Moser. Martingale families and dimension in P. Theor. Comput. Sci., 400(1-3):46-61, 2008. [ bib | DOI | http ]
[32] Philippe Moser. Baire categories on small complexity classes and meager-comeager laws. Inf. Comput., 206(1):15-33, 2008. [ bib | DOI | http ]
[33] Philippe Moser. On the convergence of Fourier series of computable Lebesgue integrable functions. 4th Conference on Computability and Complexity in Analysis, Sienna Italy, Electr. Notes Theor. Comput. Sci., 202:13-18, 2008. [ bib | DOI | http ]
[34] Pilar Albert, Elvira Mayordomo, and Philippe Moser. Bounded pushdown dimension vs Lempel Ziv information density. CoRR, abs/0704.2386, 2007. [ bib | http ]
[35] David Doty and Philippe Moser. Feasible depth. In Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pages 228-237, 2007. [ bib | DOI | http ]
[36] Xiaoyang Gu, Jack H. Lutz, and Philippe Moser. Dimensions of Copeland-Erdös sequences. Inf. Comput., 205(9):1317-1333, 2007. [ bib | DOI | http ]
[37] Philippe Moser. Martingale families and dimension in P. In Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pages 388-397, 2006. [ bib | DOI | http ]
[38] David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, and Philippe Moser. Zeta-dimension. In Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pages 283-294, 2005. [ bib | DOI | http ]
[39] Xiaoyang Gu, Jack H. Lutz, and Philippe Moser. Dimensions of Copeland-Erdös sequences. In FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings, pages 250-260, 2005. [ bib | DOI | http ]
[40] Philippe Moser. Generic density and small span theorem. In Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pages 92-102, 2005. [ bib | DOI | http ]
[41] Russell Impagliazzo and Philippe Moser. A zero one law for RP. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pages 48-52, 2003. [ bib | DOI | http ]
[42] Philippe Moser. Baire's categories on small complexity classes. In Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pages 333-342, 2003. [ bib | DOI | http ]
[43] Philippe Moser. Relative to p, APP and promise-bpp are the same. Electronic Colloquium on Computational Complexity (ECCC), 8(068), 2001. [ bib | .html ]

This file was generated by bibtex2html 1.97.