Walid Gomaa

Learn More
  • Michael L Anderson, Walid Gomaa, John Grant, Don Perlis
  • 2005
The current paper details a restricted semantics for active logic, a time-sensitive, contradiction-tolerant logical reasoning formalism. Central to active logic are special rules controlling the inheritance of beliefs in general, and beliefs about the current time in particular, very tight controls on what can be derived from direct contradictions (P &¬P),(More)
Recursive analysis is the most classical approach to model and discuss computations over the real numbers. Recently, it has been shown that com-putability classes of functions in the sense of recursive analysis can be defined (or characterized) in an algebraic machine independent way, without resorting to Turing machines. In particular nice connections(More)
Computable analysis is an extension of classical discrete computability by enhancing the normal Turing machine model. It investigates mathematical analysis from the computability perspective. Though it is well developed on the computability level, it is still under developed on the complexity perspective, that is, when bounding the available computational(More)