Stephen Binns - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2016

Mass problems and densityStephen Binns, Richard A. Shore, Stephen G. Simpson. jml, 16(2):1650006, 2016. [doi]

2013

Compressibility and Kolmogorov ComplexityStephen Binns, Marie Nicholson. ndjfl, 54(1):105-123, 2013. [doi]

Completeness, Compactness, Effective DimensionsStephen Binns. mlq, 59(3):206-218, 2013. [doi]

2011

Relative Kolmogorov complexity and geometryStephen Binns. JSYML, 76(4):1211-1239, 2011. [doi]

2009

Finding paths through narrow and wide treesStephen Binns, Bjørn Kjos-Hanssen. JSYML, 74(1):349-360, 2009. [doi]

2008

Pi:::0:::::1:: classes with complex elementsStephen Binns. JSYML, 73(4):1341-1353, 2008. [doi]

Self-Embeddings of Computable TreesStephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon. ndjfl, 49(1):1-37, 2008. [doi]

2007

Hyperimmunity in 2/sp NStephen Binns. ndjfl, 48(2):293-316, 2007. [doi]

2006

Small Pi:::0:::::1:: ClassesStephen Binns. AML, 45(4):393-410, 2006. [doi]

On a conjecture of Dobrinen and Simpson concerning almost everywhere dominationStephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon. JSYML, 71(1):119-136, 2006. [doi]

2004

Embeddings into the Medvedev and Muchnik lattices of pi:::0:::::1::classesStephen Binns, Stephen G. Simpson. AML, 43(3):399-414, 2004. [doi]

2003

A splitting theorem for the Medvedev and Muchnik latticesStephen Binns. mlq, 49(4):327-335, 2003. [doi]

Sign in or sign up to see more results.

runs on WebDSL