Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Hava Siegelmann

Theory of Computation

Hava Siegelmann is an American computer scientist and Provost Professor at the University of Massachusetts Amherst. She earned a PhD in computer science at Rutgers University in 1993 under Eduardo Sontag with a dissertation on hypercomputation, an MSc in computer science at Hebrew University in 1992 and a BA in computer science at the Technion in 1988, and she also worked briefly at MIT. She was a program manager of several DARPA artificial intelligence programs, including Lifelong Learning Machines, Guaranteeing AI Robustness Against Deception and Cooperative Secure Learning, and the DARPA and the Department of Defense awarded her the Meritorious Public Service Medal for her research and leadership. Her publications include Computation Beyond the Turing Limit in Science in 1995, the book Neural networks and analog computation: beyond the Turing limit in 1999, and the paper Support vector clustering.

Facts
Nationality
American 1
Contribution Kind
Theory 1
Notable Work
Computation Beyond the Turing Limit (Science, 1995) 1
Notable Work
Neural networks and analog computation: beyond the Turing limit (1999) 1
Connections

Affiliated With

Source Hava Siegelmann (Wikipedia)

In Field

Source Hava Siegelmann (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Hava Siegelmann (Wikipedia)Lead
Quote, Lead
is an American computer scientist and Provost Professor at the University of Massachusetts Amherst
Sources
1. Hava Siegelmann (Wikipedia)
  • Lead
    is an American computer scientist and Provost Professor at the University of Massachusetts Amherst
  • Biography, hypercomputation
    Her dissertation was on the hypercomputation.
  • Selected publications, Science paper
    Siegelmann, H.T. (1995). "Computation Beyond the Turing Limit". Science.
  • Selected publications, book
    Siegelmann, Hava T. (1999). Neural networks and analog computation: beyond the Turing limit.
  • In Group: Models of Computation and Learning, Selected publications, Turing limit
    Siegelmann, Hava T. (1999). Neural networks and analog computation: beyond the Turing limit.
  • Affiliated With: University of Massachusetts Amherst, Affiliation, university-of-massachusetts-amherst
    Provost Professor at the University of Massachusetts Amherst
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.