Results 11 to 20 of about 30,597 (268)
It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused.
Jeffrey eWatumull +4 more
doaj +6 more sources
Etude on Recursion Elimination [PDF]
Transformation-based program verification was a very important topic in early years of theory of programming. Great computer scientists contributed to these studies: John McCarthy, Amir Pnueli, Donald Knuth ... Many fascinating examples were examined and
Nikolay Shilov
doaj +2 more sources
Sonic Recursion - Sound Based Music
Sonic Recursion is a form of music composition and sound design that uses feedback as an integral source of tonal variety, using modulation sources such as Low Frequency Oscillators (LFO) and admits the possibility of chance and chaos by the use of ...
Boon, H.
core +6 more sources
Hardware acceleration of number theoretic transform for zk‐SNARK
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
Recursed is not Recursive: A Jarring Result
Recursed is a 2D puzzle platform video game featuring treasure chests that, when jumped into, instantiate a room that can later be exited (similar to function calls), optionally generating a jar that returns back to that room (similar to continuations).
Erik D. Demaine +2 more
openaire +6 more sources
To recurse or not to recurse: a low-dose CT study [PDF]
Restoring high-quality CT images from low-dose CT counterparts is an ill-posed, nonlinear problem to which deep learning approaches have shown promising results compared to classical model-based approaches. Feedforward neural networks, whose output at any given time depends only on their input at that specific time slot, have been widely used to ...
Shabab Bazrafkan +4 more
openaire +2 more sources
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation thresholds up to $n=5$. The corresponding critical clusters become more and more compact as $n$ increases, and define
Deng, Youjin +2 more
openaire +3 more sources
Symbolic Computation of Polynomial Conserved Densities, Generalized Symmetries, and Recursion Operators for Nonlinear Differential-Difference Equations [PDF]
Algorithms for the symbolic computation of polynomial conserved densities, fluxes, generalized symmetries, and recursion operators for systems of nonlinear differential-difference equations are presented. In the algorithms we use discrete versions of the
Jan A. S +15 more
core +1 more source
General Recursion and Formal Topology [PDF]
It is well known that general recursion cannot be expressed within Martin-Loef's type theory and various approaches have been proposed to overcome this problem still maintaining the termination of the computation of the typable terms.
S. Valentini, SACERDOTI COEN, CLAUDIO
core +2 more sources
Recursive categoricity and recursive stability
This paper comprises two parts. 1. A model \({\mathcal A}\) in a class \({\mathcal C}\) is strongly recursively stable in C if 1) A is recursively presented and 2) if B is elementarily equivalent to A and B is in C, then not only is B isomorphic to A but every isomorphism from B onto A is recursive.
John N. Crossley +2 more
openaire +3 more sources

