Carl Sferrazza Anthony

Carl Sferrazza Anthony is an author and commentator in the United States. He has written several books on American First Ladies.[1] He was a speechwriter for Nancy Reagan. He is a historian for the National First Ladies' Library and has made dozens of appearances on C-SPAN.[2] He lives in Los Angeles and has also written screenplays.[3]

Anthony discusses First Ladies at the U.S. National Archives in 2015

He was a contributing editor at George and a producer for the television movies Reagans (2003). He has written for several publications and his books have been reviewed in various magazines and periodicals.[4]

Bibliography
  • First Ladies: The Saga of the Presidents' Wives and Their Power published by William Morrow, New York, New York Volume 1: 1789–1961 (1990) Volume 2: 1961–1990 (1991)
  • America's Most Influential First Ladies, Oliver Press in Minneapolis, Minnesota (1992)
  • As We Remember Her: Jacqueline Kennedy Onassis, in the Words of Her Family and Friends, HarperCollins in New York, New York (1997)
  • Florence Harding: The First Lady, the Jazz Age, and the Death of America's Most Scandalous President, William Morrow in New York, New York (1998)
  • America's First Families: An Inside View of Two Hundred Years of Private Life in the White House, Touchstone in New York, New York (2000)
  • The Kennedy White House: Family Life and Pictures, 1961–1963, Simon & Schuster in New York (2001)
  • Heads of State, Bloomsbury in New York (2004)
  • Nellie Taft: The Unconventional First Lady of the Ragtime Era, William Morrow in New York (2005)
  • Edith Wilson: The First, First Lady President
gollark: Okay.
gollark: This isn't a paradox. It can't simulate arbitrarily large CGoL grids.
gollark: Nope! Many languages, abstractly speaking, *don't* have limited memory. Their implementations might, though.
gollark: No, Turing completeness means it can simulate any Turing machine. It *can't* do that if it has limited memory.
gollark: I don't know exactly what its instruction set is like. But if it has finite-sized addresses, it can probably access finite amounts of memory, and thus is not Turing-complete.

References
  1. Anthony, Carl. "Articles by Carl Anthony". Biography.
  2. "Carl Sferrazza Anthony | C-SPAN.org". www.c-span.org.
  3. "Carl Sferrazza Anthony". HarperCollins Publishers: World-Leading Book Publisher.
  4. "Anthony, Carl Sferrazza | Encyclopedia.com". www.encyclopedia.com.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.