Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
1,130
result(s) for
"Lewis, Andy"
Sort by:
Andy & Sandy and the big talent show
\"Andy and Sandy are entering the big talent show! Sandy can juggle. Sandy can tumble. Sandy can hula hoop. Andy cannot do any of these things. But when Sandy is the one who gets stage fright, Andy can save the day!\"-- Provided by publisher.
Book
Publishing Gets the Star Treatment
In many ways, she's a natural for this sort of thing - her \"Read With Jenna\" book club spots on the Today show helped some 70 tomes crack best-seller lists in the past six years - but even celebrities who had never recommended Civil War biographies or collections of poetry to their fans have been landing imprint deals of late. [...]the company, launched a few years ago by former Crown editor Molly Stern (with Elisabeth Murdoch and Stacey Snider's Sister as an early investor), has forged imprint partnerships with Sarah Jessica Parker (SJPLit), John Legend (Get Lifted Books), Lena Waithe (Hillman Grad Books) and lifestyle influencer Ayesha Curry (Sweet July Books), any one of whom could end up discovering and publishing the next Gillian Flynn (who, by the way, also has her own eponymous imprint with Zando). Stern, for one, thinks celebrities can get books attention that eludes traditional publishing marketing.
Trade Publication Article
Andy & Sandy's anything adventure
\"Andy is small. Sandy is tall. Andy is quiet. Sandy is LOUD. When these two opposites-attract best friends play dress up, anything could happen.\"-- Provided by publisher.
Book
Infinite time Turing machines
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. Every Π11 set, for example, is decidable by such machines, and the semi-decidable sets form a portion of the Δ12 sets. Our oracle concept leads to a notion of relative computability for sets of reals and a rich degree structure, stratified by two natural jump operators.
Journal Article
When Andy met Sandy
When Andy and Sandy first meet at the playground, they're cautious of one another, but soon find a way to become friends.
BOOK
Computably enumerable Turing degrees and the meet property
Working in the Turing degree structure, we show that those degrees which contain computably enumerable sets all satisfy the meet property, i.e. if a\\boldsymbol {a} is c.e. and b>a\\boldsymbol {b}>\\boldsymbol {a}, then there exists non-zero m>a\\boldsymbol {m}>\\boldsymbol {a} with b∧m=0\\boldsymbol {b} \\wedge \\boldsymbol {m}= \\boldsymbol {0}. In fact, more than this is true: m\\boldsymbol {m} may always be chosen to be a minimal degree. This settles a conjecture of Cooper and Epstein from the 1980s.
Journal Article