Philippe Moser

According to our database, Philippe Moser authored at least 46 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Pushdown and Lempel-Ziv depth.

Liam Jordon, Philippe Moser

Inf. Comput., June, 2023

2021

A Normal Sequence Compressed by PPM^* But Not by Lempel-Ziv 78.

Liam Jordon, Philippe Moser

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Normal Sequences with Non-Maximal Automatic Complexity.

Liam Jordon, Philippe Moser

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Polylog depth, highness and lowness for E.

Philippe Moser

Inf. Comput., 2020

Pebble-Depth.

Liam Jordon, Philippe Moser

CoRR, 2020

On the Difference Between Finite-State and Pushdown Depth.

Liam Jordon, Philippe Moser

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

Seeing Patterns in Randomness: A Computational Model of Surprise.

Phil Maguire, Philippe Moser, Rebecca Maguire, Mark T. Keane

Top. Cogn. Sci., 2019

2018

Limit-depth and DNR degrees.

Philippe Moser, Frank Stephan

Inf. Process. Lett., 2018

2017

Depth, Highness and DNR degrees.

Philippe Moser, Frank Stephan

Discret. Math. Theor. Comput. Sci., 2017

2016

Polynomial Depth, Highness and Lowness for E.

Philippe Moser

CoRR, 2016

2015

A Clarification on Turing's Test and its Implications for Machine Intelligence.

Phil Maguire, Philippe Moser, Rebecca Maguire

Proceedings of the EuroAsianPacific Joint Conference on Cognitive Science / 4th European Conference on Cognitive Science / 11th International Conference on Cognitive Science, 2015

2014

A Computational Theory of Subjective Probability.

Phil Maguire, Philippe Moser, Rebecca Maguire, Mark T. Keane

CoRR, 2014

Dimension spectra of random subfractals of self-similar fractals.

Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser

Ann. Pure Appl. Log., 2014

A Deep Context Grammatical Model For Authorship Attribution.

Simon Fuller, Phil Maguire, Philippe Moser

Proceedings of the Ninth International Conference on Language Resources and Evaluation, 2014

Is Consciousness Computable? Quantifying Integrated Information Using Algorithmic Information Theory.

Phil Maguire, Philippe Moser, Rebecca Maguire, Virgil Griffith

Proceedings of the 36th Annual Meeting of the Cognitive Science Society, 2014

Maximizing positive porfolio diversification.

Phil Maguire, Philippe Moser, Kieran O'Reilly, Conor McMenamin, Robert Kelly, Rebecca Maguire

Proceedings of the IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2014

2013

On the polynomial depth of various sets of random strings.

Philippe Moser

Theor. Comput. Sci., 2013

A Computational Theory of Subjective Probability [Featuring a Proof that the Conjunction Effect is not a Fallacy].

Phil Maguire, Philippe Moser, Rebecca Maguire, Mark T. Keane

Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

A probabilistic risk-to-reward measure for evaluating the performance of financial securities.

Phil Maguire, Philippe Moser, J. McDonnell, Robert Kelly, Simon Fuller, Rebecca Maguire

Proceedings of the 2013 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2013

2012

Risk-adjusted portfolio optimisation using a parallel multi-objective evolutionary algorithm.

Phil Maguire, Donal O'Sullivan, Philippe Moser, Gavin Dunne

Proceedings of the 2012 IEEE Conference on Computational Intelligence for Financial Engineering & Economics, 2012

2011

Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable.

Elvira Mayordomo, Philippe Moser, Sylvain Perifel

Theory Comput. Syst., 2011

A zero-one SUBEXP-dimension law for BPP.

Philippe Moser

Inf. Process. Lett., 2011

2009

A zero-one law for RP and derandomization of AM if NP is not small.

Russell Impagliazzo, Philippe Moser

Inf. Comput., 2009

Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression.

Elvira Mayordomo, Philippe Moser

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

2008

Martingale families and dimension in P.

Philippe Moser

Theor. Comput. Sci., 2008

Resource-bounded measure on probabilistic classes.

Philippe Moser

Inf. Process. Lett., 2008

Baire categories on small complexity classes and meager-comeager laws.

Philippe Moser

Inf. Comput., 2008

A General Notion of Useful Information

Philippe Moser

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Pushdown Compression.

Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel

Proceedings of the STACS 2008, 2008

2007

On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions.

Philippe Moser

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Bounded Pushdown dimension vs Lempel Ziv information density.

Pilar Albert, Elvira Mayordomo, Philippe Moser

Electron. Colloquium Comput. Complex., 2007

Feasible Depth.

David Doty, Philippe Moser

Proceedings of the Computation and Logic in the Real World, 2007

2006

Finite-State Dimension and Lossy Decompressors

David Doty, Philippe Moser

CoRR, 2006

Lp Computable Functions and Fourier Series

Philippe Moser

CoRR, 2006

2005

Dimensions of Copeland-Erdös Sequences

Xiaoyang Gu, Jack H. Lutz, Philippe Moser

Electron. Colloquium Comput. Complex., 2005

Generic Density and Small Span Theorem

Philippe Moser

Electron. Colloquium Comput. Complex., 2005

Zeta-Dimension.

David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2003

Locally Computed Baire's Categories on Small Complexity Classes

Philippe Moser

Electron. Colloquium Comput. Complex., 2003

RP is Small in SUBEXP else ZPP equals PSPACE and NP equals EXP

Philippe Moser

Electron. Colloquium Comput. Complex., 2003

BPP has effective dimension at most 1/2 unless BPP=EXP

Philippe Moser

Electron. Colloquium Comput. Complex., 2003

Baire's Categories on Small Complexity Classes.

Philippe Moser

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

A zero one law for RP.

Russell Impagliazzo, Philippe Moser

Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002

A generalization of Lutz's measure to probabilistic classes

Philippe Moser

Electron. Colloquium Comput. Complex., 2002

ZPP is hard unless RP is small

Philippe Moser

Electron. Colloquium Comput. Complex., 2002

Random nondeterministic real functions and Arthur Merlin games

Philippe Moser

Electron. Colloquium Comput. Complex., 2002

2001

Relative to P, APP and promise-BPP are the same

Philippe Moser

Electron. Colloquium Comput. Complex., 2001