In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model constrains theâ€¦ (More)

The interest is in characterizing insightfully the power of program selfreference in effective programming systems (epses), the computability-theoretic analogs of programming languages (for theâ€¦ (More)

In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model constrains theâ€¦ (More)

In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model constrains theâ€¦ (More)

It is well known that there exist viruses whose set of infected programs is undecidable. If a virus detector is to err on the side of caution with respect to such a virus, then it must label someâ€¦ (More)

The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algorithmic tasks (of anâ€¦ (More)

We report on a case study using the model checking tool Mpi-Spin to verify a nontrivial, deployed, MPI-based scientific program. The program, BlobFlow/ECCSVM, is an open source code implementing aâ€¦ (More)