✦ LIBER ✦

Iterative synthesis of threshold functions

✍ Scribed by E Wong; E Eisenberg

Publisher: Elsevier Science
Year: 1965
Tongue: English
Weight: 412 KB
Volume: 11
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(65)90083-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Periodic behaviour of generalized thresh

Periodic behaviour of generalized threshold functions

✍ E. Goles; J. Olivos 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 218 KB

## Communicated by C. Benzaken It is shown that, for a function A from (0, 1)" to (0, 1)" whose components form PI symmetric set of threshold functions the repeated application of A, leads either to a fixed point or to a cycle of length two.

Iterative Roots of Functions over Finite

Iterative Roots of Functions over Finite Fields

✍ K. B. Dunn; R. Lidl 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 590 KB

Let gn denote the iterates of a function y from the finite field FG into itself, defined induct~ively by go@) = x and g"(x) = g ( g n -l ( x ) ) , n>O. We study the existence of solutions to the functional equation g"=f, where f is a given linear, quadratic or CHEBYSIIEV function on .Fq, \*) Researc

Computing threshold functions by depth-3

Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates

✍ Stasys Jukna 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 326 KB

Dimension theory of iterated function sy

Dimension theory of iterated function systems

✍ De-Jun Feng; Huyi Hu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 463 KB

## Abstract Let {__S~i~__} be an iterated function system (IFS) on ℝ^__d__^ with attractor __K__. Let (Σ, σ) denote the one‐sided full shift over the alphabet {1, …, 𝓁}. We define the projection entropy function __h__~π~ on the space of invariant measures on Σ associated with the coding map π : Σ →

Iterative Characterizations of Computabl

Iterative Characterizations of Computable Unary Functions: A General Method

✍ Stefano Mazzanti 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

## Abstract Iterative characterizations of computable unary functions are useful patterns for the definition of programming languages based on iterative constructs. The features of such a characterization depend on the pairing producing it: this paper offers an infinite class of pairings involving

Fix-points of meromorphic functions and

Fix-points of meromorphic functions and iterated entire functions

✍ Walter Bergweiler 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 583 KB