On Approximate Decidability of Minimal Programs
نویسندگان
چکیده
منابع مشابه
A On approximate decidability of minimal programs
An index e in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from e. Since the 1960’s it has been known that, in any reasonable programming language, no effective procedure determines whether or not a given index is minimal. We investigate whether the task of determining minimal indices can be solved in an approximate sense. Our ...
متن کاملOn the decidability of FDNC programs
Il Milione: A Journey in the Computational Logic in Italy 55 SOMMARIO/ABSTRACT Questo articolo introduce una nuova dimostrazione della decidibilità del controllo di consistenza per i programmi FDNC sotto la semantica dei modelli stabili, basandosi su splitting sequences regolari. Con questa tecnica, riusciamo a rilassare leggermente la definizione di programmi FDNC e muoviamo un primo passo ver...
متن کاملDecidability of All Minimal Models
This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows a proof of the existence of a cellular term in each observational equivalence class of a minimal model. The first proof I gave of the decidability of all minimal models [3] was far from being easy to understand. I was only an inexperienced studen...
متن کاملOn the expressiveness and decidability of o-minimal hybrid systems
This paper is driven by a general motto: bisimulate a hybrid system by a finite symbolic dynamical system. In the case of o-minimal hybrid systems, the continuous and discrete components can be decoupled, and hence, the problem reduces in building a finite symbolic dynamical system for the continuous dynamics of each location. We show that this can be done for a quite general class of hybrid sy...
متن کاملOn the Decidability of Verifying LTL Properties of GOLOG Programs∗
The high-level action programming language GOLOG is a useful means for modeling the behavior of autonomous agents such as mobile robots. It relies on a representation given in terms of a logic-based action theory in the Situation Calculus (SC). To guarantee that the possibly non-terminating execution of a GOLOG program leads to the desired behavior of the agent, it is desirable to (automaticall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2015
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2799561