Results 1 to 10 of about 26,685 (258)
Convergence of recursive functions on computers
The Journal of Engineering, 2014 A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions {f(n)} is convergent on a metric space I ⊆ ℝ, then it is possible to observe this behaviour on the set 𝔻 ⊂ ℚ of ...
Erivelton Geraldo Nepomuceno
doaj +3 more sources
Farey recursive functions [PDF]
Involve, a Journal of Mathematics, 2021 This paper introduces Farey Recursive Functions and investigates their basic properties. Farey Recursive Functions are a special type of recursive function from the rationals to a commutative ring. The recursion of these functions is organized by the Farey graph. They arise naturally in the study of 2-bridge knots and links.
Chesebro, Eric +5 more
openaire +4 more sources
Recursive Definitions of Monadic Functions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative ...
Alexander Krauss
doaj +1 more source
Normal Functions As A New Way Of Defining Computable Functions [PDF]
Computer Science, 2004 Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way.
Leszek Dubiel
doaj +2 more sources
On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions
Моделирование и анализ информационных систем, 2020 Raphael Robinson showed that all primitive recursive functions depending on one argument, and only they could be obtained from two functions s(x) = x +1 and q(x) = x - [√x]² by using operations of addition +, superposition ∗ and iteration i.
Valery A. Sokolov
doaj +1 more source
Pointers in Recursion: Exploring the Tropics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We translate the usual class of partial/primitive recursive functions to a pointer recursion framework, accessing actual input values via a pointer reading unit-cost function.
Paulin Jacobé de Naurois
doaj +1 more source
Hilbert's Tenth Problem in Coq (Extended Version) [PDF]
Logical Methods in Computer Science, 2022 We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory.
Dominique Larchey-Wendling +1 more
doaj +1 more source
A Step-Indexing Approach to Partial Functions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We describe an ACL2 package for defining partial recursive functions that also supports efficient execution. While packages for defining partial recursive functions already exist for other theorem provers, they often require inductive definitions or ...
David Greve, Konrad Slind
doaj +1 more source
Kombinator-Y untuk Melakukan Memoizing Fungsi Rekursif
ComTech, 2012 This article discusses how to find a solution of a recursive function such as Fibonacci or factorial numbers without repetition. Therefore, a recursive function is considered a fixed-point of non-recursive function.
Subandijo Subandijo
doaj +1 more source
On the complexity of integer polynomial recursive sequences
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022 Background. Linear recursive sequences represent the “classic'” object of combinatorial analysis. To express an arbitrary term of a linear recursive sequence, there are exact formulas of exponential type as in the case of a field of complex numbers ...
S.S. Marchenkov
doaj +1 more source