#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1996

2019

- This year (3)
- Last 5 years (18)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Philip Maymin
- 1997

We show that the lambda-q calculus can efficiently simulate quantum Turing machines by showing how the lambda-q calculus can efficiently simulate a class of quantum cellular automaton that are… (More)

- Philip Maymin
- 1996

This paper introduces a formal metalanguage called the lambda-q calculus for the specification of quantum programming languages. This metalanguage is an extension of the lambda calculus, which… (More)

- Philip Maymin
- 2013

We show that any objective risk measurement algorithm mandated by central banks for regulated financial entities will result in more risk being taken by those financial entities than would otherwise… (More)

- Philip Maymin
- Algorithmic Finance
- 2011

I prove that if markets are weak-form efficient, meaning current prices fully reflect all information available in past prices, then P = NP, meaning every computational problem whose solution can be… (More)

- Philip Maymin
- Risk and Decision Analysis
- 2009

A behavioral representative investor who evaluates a single risky asset based on cumulative prospect theory will often induce high kurtosis, negative skewness, and persistent autocorrelation into the… (More)

- Philip Maymin
- Risk and Decision Analysis
- 2011

- Philip Maymin
- 2017

- Philip Maymin
- 2011