Mechanical verification of mutually recursive procedures

Author(s):  
Peter V. Homeier ◽  
David F. Martin
2003 ◽  
Vol 187 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Peter V. Homeier ◽  
David F. Martin

2003 ◽  
Vol 06 (02) ◽  
pp. 241-249
Author(s):  
JOSEPH L. PE

Many sequences from number theory, such as the primes, are defined by recursive procedures, often leading to complex local behavior, but also to graphical similarity on different scales — a property that can be analyzed by fractal dimension. This paper computes sample fractal dimensions from the graphs of some number-theoretic functions. It argues for the usefulness of empirical fractal dimension as a distinguishing characteristic of the graph. Also, it notes a remarkable similarity between two apparently unrelated sequences: the persistence of a number, and the memory of a prime. This similarity is quantified using fractal dimension.


2001 ◽  
Vol 171 (2) ◽  
pp. 156-182 ◽  
Author(s):  
Johann Blieberger

1990 ◽  
Vol 84 (2) ◽  
pp. 129-162 ◽  
Author(s):  
Pierre America ◽  
Frank de Boer

1993 ◽  
Vol 5 (6) ◽  
pp. 554-570 ◽  
Author(s):  
Wim H. Hesselink

Author(s):  
Xenia Naidenova

The most important steps in the direction to an integrative model of deductive-inductive commonsense reasoning are made in this chapter. The decomposition of inferring good classification tests is advanced into two kinds of subtasks that are in accordance with human mental acts. This decomposition allows modeling incremental inductive-deductive inferences. We give two basic recursive procedures based on two kinds of subtasks for inferring all good maximally redundant classification tests (GMRTs): ASTRA and DIAGaRa. An incremental algorithm INGOMAR for inferring all GMRTs is presented too. The problems of creating an integrative inductive-deductive model of commonsense reasoning are discussed in the last section of this chapter.


Sign in / Sign up

Export Citation Format

Share Document