We exhibit a polynomial time computable plane curve Γ that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of Γ and every positive integer n, there is some positive-length subcurve of Γ that f retraces at least n times. In contrast, every computable curve of finite length that does not int...

This article defines two for-loop statements for SCMPDS. One is called for-up, which corresponds to ”for (i=x; i<0; i+=n) S” in C language. Another is called for-down, which corresponds to ”for (i=x; i>0; i-=n) S”. Here, we do not present their unconditional halting (called parahalting) property, because we have not found that there exists a useful for-loop statement with unconditional halting,...

Dialectical egalitarianism holds that every asserted proposition requires defence when challenged by an interlocutor. This view apparently generates a vicious “regress of justifications,” since an interlocutor can challenge the premises through which a speaker defends her original assertion, and so on ad infinitum. To halt the regress, dialectical foundationalists such as Adler, Brandom, Leite,...

In this paper, we study controlled adaptability of metamodel transformations. We consider one of the most rigid metamodel evolution formalisms — automated grammar transformation with operator suites, where a transformation script is built in such a way that it is essentially meant to be applicable only to one designated input grammar fragment. We propose a new model of processing unidirectional...

Debuggers allow a user to halt a program and examine its state. The debugger stops execution when some user-speci ed condition is satis ed: Code breakpoints halt program execution when a particular instruction is executed. Data breakpoints halt program execution when a variable is referenced. Code breakpoints are supported directly in hardware on most machines and are fast. Data breakpoints, ho...

The Halting Problem is a version of the Liar's Paradox.

The halting problem for Turing machines is decidable on a set of asymptotic probability one. The proof is sensitive to the particular computational model. The halting problem for Turing machines is perhaps the canonical undecidable set. Nevertheless, we prove that there is an algorithm deciding almost all instances of it. The halting problem is therefore among the growing collection of those ex...

The halting problem for Turing machines is decidable on a set of asymptotic probability one. The proof is sensitive to the particular computational model. The halting problem for Turing machines is perhaps the canonical undecidable set. Nevertheless, we prove that there is an algorithm deciding almost all instances of it. The halting problem is therefore among the growing collection of those ex...

We present G12IDE, a front-end for the G12 platform aimed at helping users create and work with constraint models in a manner independent from any underlying solver. G12IDE contains tools for writing and evaluating models using Zinc and provides a feature rich debugger for monitoring a running search process. Debugging a search, as opposed to debugging sequential code, requires concepts such as...

Abstract — Tien D. Kieu, in 10 papers posted to the quant-ph section of the xxx.lanl.gov preprint archive [some of which were also published in printed journals such as Proc. Royal Soc. A 460 (2004) 1535] had claimed to have a scheme showing how, in principle, physical “quantum adiabatic systems” could be used to solve the prototypical computationally undecidable problem, Turing’s“halting probl...