Michael Anderson. Approximation to a decision procedure for the halting problem. Notre Dame journal of formal logic, vol. 9 no. 4 (for 1968, pub. 1969), pp. 305–312.

1970 ◽  
Vol 35 (3) ◽  
pp. 480-480
Author(s):  
Philip K. Hooper
Keyword(s):  
Decision Procedure ◽  
Formal Logic ◽  
Halting Problem

The unsolvability of the uniform halting problem for two state Turing machines

1969 ◽  
Vol 34 (2) ◽  
pp. 161-165 ◽  
Author(s):  
Gabor T. Herman
Keyword(s):  
Finite Number ◽  
Turing Machine ◽  
Decision Procedure ◽  
Turing Machines ◽  
Halting Problem

The uniform halting problem (UH) can be stated as follows:Give a decision procedure which for any given Turing machine (TM) will decide whether or not it has an immortal instantaneous description (ID).An ID is called immortal if it has no terminal successor. As it is generally the case in the literature (see e.g. Minsky [4, p. 118]) we assume that in an ID the tape must be blank except for some finite number of squares. If we remove this restriction the UH becomes the immortality problem (IP).

A simple solution of the uniform halting problem

1970 ◽  
Vol 34 (4) ◽  
pp. 639-640 ◽  
Author(s):  
Gabor T. Herman
Keyword(s):  
Turing Machine ◽  
Decision Procedure ◽  
Simple Solution ◽  
Halting Problem

The uniform halting problem (UH) can be stated as follows.Give a decision procedure which for any given Turing machine (TM) will decide whether or not it has an immortal instantaneous description (ID).An ID is called immortal if it has no terminal successor. As it is generally the case in the literature (see e.g. Minsky [3, p. 118]) we assume that in an ID the tape must be blank except for some finite numbers of squares. If we remove this restriction the UH becomes the immortality problem (IP). The UH should not be confused with the initialised uniform halting problem (whether or not a TM has an immortal ID when started in a specified state) which can easily be shown to be undecidable (see e.g. Minsky [3, p. 151]).

ALGEBRA OF PREDICATES AND RELATED GEOMETRIC MODELS CREATION IN REGARDS OF UNIFIED STATE EXAM IN INFORMATICS (RUSSIAN EGE)

2019 ◽  
pp. 40-47
Author(s):  
E. A. Mironchik
Keyword(s):  
Geometric Model ◽  
Main Idea ◽  
Formal Logic ◽  
High Complexity ◽  
Geometric Models ◽  
Complexity Problem ◽  
Logical Expression ◽  
State Examination

The article discusses the method of solving the task 18 on the Unified State Examination in Informatics (Russian EGE). The main idea of the method is to write the conditions of the problem utilizing the language of formal logic, using elementary predicates. According to the laws of logic the resulting complex logical expression would be transformed into an expression, according to which a geometric model is supposed to be constructed which allows to obtain an answer. The described algorithm does allow high complexity problem to be converted into a simple one.

¿Razonamos en función de nuestro conocimiento general? Un estudio de las interacciones entre el procesamiento de la información y la inferencia lógica

2015 ◽  
pp. 33
Author(s):  
Miguel López Astorga
Keyword(s):  
Information Processing ◽  
Teaching And Learning ◽  
Learning Processes ◽  
Formal Logic ◽  
Conditional Reasoning ◽  
General Knowledge

RESUMENEn este trabajo, analizamos un experimento sobre el razonamiento condicional de Staller, Sloman y Ben-Zeev (2000). En dicho experimento, los sujetos parecen manifestar un comportamiento contrario a las prescripciones de la lógica formal. Nosotros lo revisamosy descubrimos todas las variables que es preciso atender en los procesos de enseñanza y aprendizaje, variables que no siempre son consideradas por los docentes.Palabras clave: condicional, conocimiento general, inferencia, procesamiento de la información, representación mental.DO WE REASON ACCORDING TO OUR GENERALKNOWLEDGE? A STUDY ABOUT INTERACTIONSBETWEEN INFORMATION PROCESSING AND LOGICALINFERENCEABSTRACTIn this paper, I analyze an experiment about conditional reasoning presented by Staller,Sloman and Ben-Zeev (2000). In that experiment, the subjects’ behavior seems contradictory to prescriptions of formal logic. I check it and I discover all the variables that we need to deal with them in teaching and learning processes, despite that such variables are notalways checked by the teachers.Keywords: conditional, general knowledge, inference, information processing, mentalrepresentation.

A Decision Procedure for Bit-Vector Arithmetic

1998 ◽  
Author(s):  
Clark W. Barrett ◽  
David L. Dill ◽  
Jeremy R. Levitt
Keyword(s):  
Decision Procedure ◽  
Bit Vector

Samuel Beckett's Debt to Aristotle: Cosmology, Syllogism, Space, Time

2010 ◽  
Vol 22 (1) ◽  
pp. 181-195 ◽  
Author(s):  
Anthony Cordingley
Keyword(s):  
Trinity College ◽  
Space Time ◽  
Formal Logic ◽  
Trinity College Dublin ◽  
Space And Time ◽  
Creative Transformation ◽  
Cosmic Order

This essay argues for the presence of Aristotelian ideas of cosmic order, syllogism, space and time in Beckett's . It accounts for how such ideas impact upon the novel's 'I' as he attempts to offer a philosophical 'solution' to his predicament in an underworld divorced from the revolving heavens. Beckett's study of formal logic as a student at Trinity College, Dublin and his private study of philosophy in 1932 is examined in this light; particularly his “Philosophy Notes,” along with some possible further sources for his knowledge. The essay then reveals a creative transformation of Aristotelian ideas in which led to formal innovations, such as the continuous present of its narrative.

Sign in / Sign up

Export Citation Format

Share Document