咨询与建议

限定检索结果

文献类型

  • 836 篇 期刊文献
  • 438 篇 会议
  • 86 册 图书
  • 1 篇 学位论文

馆藏范围

  • 1,351 篇 电子文献
  • 10 种 纸本馆藏

日期分布

学科分类号

  • 780 篇 理学
    • 693 篇 数学
    • 57 篇 物理学
    • 43 篇 统计学(可授理学、...
    • 20 篇 系统科学
    • 14 篇 科学技术史(分学科...
    • 13 篇 生物学
    • 11 篇 化学
  • 667 篇 工学
    • 536 篇 计算机科学与技术...
    • 252 篇 软件工程
    • 65 篇 电气工程
    • 53 篇 控制科学与工程
    • 22 篇 电子科学与技术(可...
    • 22 篇 信息与通信工程
    • 12 篇 力学(可授工学、理...
    • 10 篇 机械工程
    • 9 篇 化学工程与技术
    • 8 篇 动力工程及工程热...
    • 6 篇 材料科学与工程(可...
    • 6 篇 建筑学
  • 77 篇 管理学
    • 47 篇 管理科学与工程(可...
    • 24 篇 图书情报与档案管...
    • 6 篇 工商管理
    • 6 篇 公共管理
  • 29 篇 经济学
    • 18 篇 理论经济学
    • 14 篇 应用经济学
  • 24 篇 哲学
    • 20 篇 哲学
  • 12 篇 医学
    • 6 篇 基础医学(可授医学...
    • 6 篇 临床医学
  • 11 篇 法学
    • 11 篇 社会学
  • 8 篇 教育学
    • 5 篇 心理学(可授教育学...
  • 8 篇 农学
  • 6 篇 文学
  • 4 篇 艺术学
  • 1 篇 历史学

主题

  • 1,361 篇 recursive functi...
  • 187 篇 mathematical the...
  • 119 篇 logical theorems
  • 92 篇 recursion
  • 80 篇 algorithms
  • 75 篇 integers
  • 62 篇 recursively enum...
  • 60 篇 natural numbers
  • 57 篇 nasa technical r...
  • 57 篇 (ntrs)
  • 51 篇 degree of unsolv...
  • 46 篇 arithmetic
  • 42 篇 mathematical ind...
  • 34 篇 polynomials
  • 31 篇 recursion theory
  • 31 篇 approximation
  • 31 篇 algebra
  • 27 篇 induction assump...
  • 26 篇 equivalence rela...
  • 23 篇 oracles

机构

  • 7 篇 natl univ singap...
  • 6 篇 univ maryland de...
  • 5 篇 inria
  • 5 篇 univ wisconsin d...
  • 5 篇 univ munster ins...
  • 4 篇 univ kaiserslaut...
  • 4 篇 school of comput...
  • 4 篇 univ calif san d...
  • 4 篇 massachusetts in...
  • 4 篇 rutgers state un...
  • 4 篇 università degli...
  • 3 篇 university of ca...
  • 3 篇 ohio state univ ...
  • 3 篇 mit cambridge ma...
  • 3 篇 institute of mat...
  • 3 篇 univ edinburgh e...
  • 3 篇 univ chicago il ...
  • 3 篇 department of co...
  • 3 篇 univ calif berke...
  • 3 篇 natl univ singap...

作者

  • 11 篇 remmel jb
  • 9 篇 stephan frank
  • 8 篇 jain s
  • 7 篇 jockusch cg
  • 6 篇 zeugmann thomas
  • 6 篇 roversi luca
  • 6 篇 dipaola ra
  • 6 篇 dekker jce
  • 6 篇 jain sanjay
  • 6 篇 wiehagen r
  • 6 篇 kummer m
  • 6 篇 stephan f
  • 5 篇 slaman ta
  • 5 篇 kutrib martin
  • 5 篇 nipkow tobias
  • 5 篇 herrmann e
  • 5 篇 hu zhenjiang
  • 5 篇 downey rg
  • 5 篇 owings jc
  • 5 篇 byerly re

语言

  • 1,303 篇 英文
  • 43 篇 其他
  • 8 篇 法文
  • 3 篇 中文
  • 2 篇 俄文
  • 1 篇 德文
  • 1 篇 日文
检索条件"主题词=Recursive functions"
1361 条 记 录,以下是111-120 订阅
排序:
Programming-by-example by programming-by-example: Synthesis of looping programs
arXiv
收藏 引用
arXiv 2021年
作者: Berman, Shmuel Santolucito, Mark Columbia University New York United States Barnard College Columbia University New York United States
Program synthesis has seen many new applications in recent years, in large part thanks to the introduction of SyGuS. However, no existing SyGuS solvers have support for synthesizing recursive functions. We introduce a... 详细信息
来源: 评论
Y IS A LEAST FIXED POINT COMBINATOR
arXiv
收藏 引用
arXiv 2025年
作者: Helfer, Joseph
The theory of recursive functions is related in a well-known way to the notion of least fixed points, by endowing a set of partial functions with an ordering in terms of their domain of definition. When terms in the p... 详细信息
来源: 评论
Shelah's partition functions and the Hales-Jewett numbers
arXiv
收藏 引用
arXiv 2021年
作者: Golshani, Mohammad Mirabi, Mostafa P.O. Box: 19395-5746 Tehran Iran Department of Mathematics and Computer Science Wesleyan University MiddletownCT06459 United States
In this paper we study several partition relations, defined by Saharon Shelah, and relate them to the Hales-Jewett numbers. In particular we give an upper bound for the Hales-Jewett numbers using the primitive recursi... 详细信息
来源: 评论
A Universal Primitive recursive Function?1
arXiv
收藏 引用
arXiv 2021年
作者: Parent, T. Nazarbayev University Kazakhstan
This paper details an algorithm for a binary, primitive recursive functionthat apparently computes, for any $i$ and $n$, $f_i\\left(i,n\ight)$. Thealgorithm works by exploiting the fact that in the formal system descr... 详细信息
来源: 评论
Tail modulo cons
arXiv
收藏 引用
arXiv 2021年
作者: Bour, Frédéric Clément, Basile Scherer, Gabriel INRIA Tarides 74 Rue de la Tombe Issoire Paris75014 France
OCaml function calls consume space on the system stack. Operating systems set default limits on the stack space which are much lower than the available memory. If a program runs out of stack space, they get the dreade... 详细信息
来源: 评论
The first moment of quadratic twists of modular L-functions
arXiv
收藏 引用
arXiv 2021年
作者: Shen, Quanli SDU-ANU Joint Science College Shandong University Weihai264209 China
We obtain an asymptotic formula with an error term O(X 1 2 +Ε) for the smoothed first moment of quadratic twists of modular L-functions. We also give a similar result for the smoothed first moment of the first deriva... 详细信息
来源: 评论
Splitting recursion schemes into reversible and classical interacting threads
arXiv
收藏 引用
arXiv 2021年
作者: Matos, Armando B. Paolini, Luca Roversi, Luca Universidade do Porto Departamento de Ciência de Computadores Portugal Università degli Studi di Torino Dipartimento di Informatica Italy
Given a simple recursive function, we show how to extract from it a reversible and an classical iterative part. Those parts can synchronously cooperate under a Producer/Consumer pattern in order to implement the origi... 详细信息
来源: 评论
Synthesis with asymptotic resource bounds
arXiv
收藏 引用
arXiv 2021年
作者: Hu, Qinheping Cyphert, John D'Antoni, Loris Reps, Thomas University of Wisconsin-Madison Madison United States
We present a method for synthesizing recursive functions that satisfy both a functional specification and an asymptotic resource bound. Prior methods for synthesis with a resource metric require the user to specify a ... 详细信息
来源: 评论
UNIFORM TREATMENTS OF BERNOULLI NUMBERS, STIRLING NUMBERS, AND THEIR GENERATING functions
arXiv
收藏 引用
arXiv 2025年
作者: Qi, Feng School of Mathematics and Informatics Henan Polytechnic University Henan Jiaozuo454010 China 17709 Sabal Court DallasTX75252-8024 United States School of Mathematics and Physics Hulunbuir University Inner Mongolia Hailar021008 China
In this paper, by virtue of a determinantal formula for derivatives of the ratio between two differentiable functions, in view of the Faà di Bruno formula, and with the help of several identities and closed-form ... 详细信息
来源: 评论
Quantum K-theory of flag varieties via non-abelian localization
arXiv
收藏 引用
arXiv 2021年
作者: Yan, Xiaohan Sorbonne Université Université Paris Cité CNRS IMJ-PRG ParisF-75005 France
In this paper, we reconstruct explicitly the generating function of genus-zero K-theoretic permutation-invariant Gromov-Witten invariants, known as the big J-function, for any partial flag variety. The reconstruction ... 详细信息
来源: 评论