Melvyn Bragg and guests discuss the outbreak of witch trials in Massachusetts in 1692-3, centred on Salem, which led to the execution of twenty people, with more dying in prison before or after trial. Some were men, including Giles Corey who died after being pressed with heavy rocks, but the majority were women. At its peak, around 150 people were suspected of witchcraft, including the wife of the governor who had established the trials. Many of the claims of witchcraft arose from personal rivalries in an area known for unrest, but were examined and upheld by the courts at a time of mass hysteria, belief in the devil, fear of attack by Native Americans and religious divisions.With Susan Castillo-Street
Harriet Beecher Stowe Professor Emerita of American Studies at King's College LondonSimon Middleton
Senior Lecturer in American History at the University of SheffieldAnd Marion Gibson
Professor of Renaissance and Magical Literatures at Exeter University, Penryn Campus.Producer: Simon Tillotson.
Kultur & GesellschaftPolitikWirtschaftReligiösTalk
In Our Time With Melvyn Bragg Folgen
Melvyn Bragg and his guests discuss the history of ideas - including topics drawn from philosophy, science, history, religion and culture.
Folgen von In Our Time With Melvyn Bragg
1098 Folgen
-
Folge vom 26.11.2015The Salem Witch Trials
-
Folge vom 19.11.2015Emma"Emma Woodhouse, handsome, clever, and rich, with a comfortable home and happy disposition, seemed to unite some of the best blessings of existence; and had lived nearly twenty-one years in the world with very little to distress or vex her." So begins Emma by Jane Austen, describing her leading character who, she said, was "a heroine whom no-one but myself will much like." Melvyn Bragg and guests discuss this, one of Austen's most popular novels and arguably her masterpiece, a brilliantly sparkling comedy of manners published in December 1815 by John Murray, the last to be published in Austen's lifetime. This followed Sense and Sensibility (1811), Pride and Prejudice (1813) and Mansfield Park (1814), with her brother Henry handling publication of Northanger Abbey and Persuasion (1817). With Janet Todd Professor Emerita of Literature, University of Aberdeen and Honorary Fellow of Newnham College, CambridgeJohn Mullan Professor of English at University College, LondonAndEmma Clery Professor of English at the University of Southampton.Producer: Simon Tillotson.
-
Folge vom 12.11.2015The Battle of LepantoMelvyn Bragg and guests discuss The Battle of Lepanto, 1571, the last great sea battle between galleys, in which the Catholic fleet of the Holy League of principally Venice, Spain, the Papal States, Malta, Genoa, and Savoy defeated the Ottoman forces of Selim II. When much of Europe was divided over the Reformation, this was the first major victory of a Christian force over a Turkish fleet. The battle followed the Ottoman invasion of Venetian Cyprus and decades in which the Venetians had been trying to stop the broader westward expansion of the Ottomans into the Mediterranean. The outcome had a great impact on morale in Europe and Pope Pius V established a feast day of Our Lady of Victory. Some historians call it the most significant sea battle since Actium (31 BC). However, the Ottomans viewed the loss as less significant than their victory in Cyprus and, within two years, the Holy League had broken up.WithDiarmaid MacCulloch Professor of the History of the Church at the University of OxfordKate Fleet Director of the Skilliter Centre for Ottoman Studies and Fellow of Newnham College, University of CambridgeAndNoel Malcolm A Senior Research Fellow in History at All Soul's College, University of Oxford Producer: Simon Tillotson.
-
Folge vom 05.11.2015P v NPMelvyn Bragg and guests discuss the problem of P versus NP, which has a bearing on online security. There is a $1,000,000 prize on offer from the Clay Mathematical Institute for the first person to come up with a complete solution. At its heart is the question "are there problems for which the answers can be checked by computers, but not found in a reasonable time?" If the answer to that is yes, then P does not equal NP. However, if all answers can be found easily as well as checked, if only we knew how, then P equals NP. The area has intrigued mathematicians and computer scientists since Alan Turing, in 1936, found that it's impossible to decide in general whether an algorithm will run forever on some problems. Resting on P versus NP is the security of all online transactions which are currently encrypted: if it transpires that P=NP, if answers could be found as easily as checked, computers could crack passwords in moments.With Colva Roney-Dougal Reader in Pure Mathematics at the University of St AndrewsTimothy Gowers Royal Society Research Professor in Mathematics at the University of CambridgeAnd Leslie Ann Goldberg Professor of Computer Science and Fellow of St Edmund Hall, University of OxfordProducer: Simon Tillotson.