Recursive Procedures; Predefined Subprograms

1981 ◽  
pp. 82-89
Author(s):  
Günther Lamprecht
Keyword(s):  
Recursive Procedures

FRACTAL DIMENSION, PRIMES, AND THE PERSISTENCE OF MEMORY

2003 ◽  
Vol 06 (02) ◽  
pp. 241-249
Author(s):  
JOSEPH L. PE
Keyword(s):  
Number Theory ◽  
Fractal Dimension ◽  
Fractal Dimensions ◽  
Distinguishing Characteristic ◽  
Local Behavior ◽  
Remarkable Similarity ◽  
Recursive Procedures

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.

scholarly journals Real-Time Properties of Indirect Recursive Procedures

2001 ◽  
Vol 171 (2) ◽  
pp. 156-182 ◽  
Author(s):  
Johann Blieberger
Keyword(s):  
Real Time ◽  
Recursive Procedures

scholarly journals Proving total correctness of recursive procedures

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

scholarly journals Proof rules for recursive procedures

1993 ◽  
Vol 5 (6) ◽  
pp. 554-570 ◽  
Author(s):  
Wim H. Hesselink
Keyword(s):  
Proof Rules ◽  
Recursive Procedures

Towards an Integrative Model of Deductive-Inductive Commonsense Reasoning

2010 ◽  
pp. 245-278
Author(s):  
Xenia Naidenova
Keyword(s):  
Incremental Algorithm ◽  
Integrative Model ◽  
Commonsense Reasoning ◽  
Recursive Procedures ◽  
Good Classification ◽  
Mental Acts ◽  
Made In

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.

Inference rules for proving the equivalence of recursive procedures

2008 ◽  
Vol 45 (6) ◽  
pp. 403-439 ◽  
Author(s):  
Benny Godlin ◽  
Ofer Strichman
Keyword(s):  
Inference Rules ◽  
Recursive Procedures

Comments on the implementation of recursive procedures and blocks in ALGOL 60

1961 ◽  
Vol 4 (1) ◽  
pp. 65-69 ◽  
Author(s):  
E. T. Irons ◽  
W. Feurzeig
Keyword(s):  
Recursive Procedures
Sign in / Sign up

Export Citation Format

Share Document