Sleeping Beauty her Princess Aurora; however, in the Disney version, she is also called "Briar Rose" in her childhood, when she is being raised incognito by the good fairies. John Stejean named her "Rosebud" in TeleStory Presents. The Brothers Grimm included a variant " Little Briar Rose" in their collection (1812). Their version ends when the prince arrives to wake Sleeping Beauty, unlike the stories of Basile and Perrault. Some translations of the Grimms' tale give the princess the name "Rosamond". The brothers considered rejecting the story on the grounds that it was derived from Perrault's version, but the presence of the
Sleeping Beauty problem are being run; consider a program that is run twice after tails is flipped and once after heads is flipped. Sleeping Beauty problem The Sleeping Beauty problem is a puzzle in decision theory in which an ideally rational epistemic agent is to be woken once or twice according to the toss of a coin, once if heads and twice if tails, and asked her degree of belief for the coin having come up heads. The problem was originally formulated in unpublished work in the mid 1980s by Arnold Zuboff (work that was later published as "One Self: The Logic of