Results 241 to 250 of about 31,249 (277)

Recursive Boolean algebras with recursive atoms

Journal of Symbolic Logic, 1981
A Boolean algebra (henceforth abbreviated B.A.) is said to be recursive if B is a recursive subset of the natural numbers N and the operations ∧ (meet), ∨ (join), and ¬ (complement) are partial recursive. Let denote the set of atoms of and denote the ideal generated by the atoms of .
openaire   +3 more sources

Recursive Enumerability and Recursivity

1993
Abstract Having proved that Peano Arithmetic is incomplete, we can ask another question about the system. Is there any algorithm (mechanical procedure) by which we can determine which sentences are provable in the system and which are not? This brings us to the subject of recursive function theory, to which we now turn.
openaire   +1 more source

Recursive Colorings of Highly Recursive Graphs

Canadian Journal of Mathematics, 1981
One of the attractions of finite combinatorics is its explicit constructions. This paper is part of a program to enlarge the domain of finite combinatorics to certain infinite structures while preserving the explicit constructions of the smaller domain. The larger domain to be considered consists of the recursive structures.
openaire   +2 more sources

Recursion and Recursive Algorithms

1978
Before continuing with the treatment of search methods a full discussion of recursion is needed to prepare the ground for the next chapter on binary trees.
openaire   +1 more source

A Difference in Complexity Between Recursion and Tail Recursion

Theory of Computing Systems, 2016
Two types of recursive programs over abstract structures are considered in this paper -- the most general recursive programs and tail recursive programs (which are equivalent to iterative programs). There are structures over which these two types determine one and the same class of computable functions. However, is the price of the computations one and
openaire   +3 more sources

Recursive Graphs, Recursive Labelings and Shortest Paths

SIAM Journal on Computing, 1981
We consider classes of undirected, not weighted graphs which have recursive representations; these include trees, maximal outplanar graphs, k-trees, chordal graphs, and minimally two-connected graphs. We investigate invariants of recursive labelings of some of these graphs.
openaire   +2 more sources

Recursive and nonrecursive programs

1997
For a universal programming language (like Pascal) recursion is, in a sense, redundant: for any recursive program it is possible to write an equivalent program without recursion. Of course, this does not mean that recursion should be avoided, because it allows us to provide elegant solutions to otherwise complicated problems.
openaire   +1 more source

Induction and Recursion

1995
The main purpose of this chapter is to introduce recursion. Recursion is a simple yet powerful idea that can be enormously useful in developing algorithms for solving complex problems. This is especially true if an algorithm is to be implemented in Lisp or a related programming language such as Scheme.
openaire   +1 more source

Recursion in aphasia

Clinical Linguistics & Phonetics, 2010
This study investigates how aphasic impairment impinges on syntactic and/or semantic recursivity of human language. A series of tests has been conducted with the participation of five Hungarian speaking aphasic subjects and 10 control subjects. Photographs representing simple situations were presented to subjects and questions were asked about them ...
openaire   +2 more sources

An Interesting Recursion

The American Mathematical Monthly, 2004
(2004). An Interesting Recursion. The American Mathematical Monthly: Vol. 111, No. 6, pp. 528-530.
openaire   +2 more sources