咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是61-70 订阅
排序:
Elgot Categories and Abacus Programs
arXiv
收藏 引用
arXiv 2025年
作者: Nester, Chad Institute of Computer Science University of Tartu Tartu Estonia
We introduce Elgot categories, a sort of distributive monoidal category with additional structure in which the partial recursive functions are representable. Moreover, we construct an initial Elgot category, the morph... 详细信息
来源: 评论
POINTWISE ORDER OF GENERALIZED HOFSTADTER functions G, H AND BEYOND
arXiv
收藏 引用
arXiv 2024年
作者: Letouzey, Pierre Li, Shuo Steiner, Wolfgang Université Paris Cité CNRS Inria IRIF ParisF-75013 France Department of Mathematics and Statistics University of Winnipeg 515 Portage Avenue WinnipegMBR3B 2E9 Canada Université Paris Cité CNRS IRIF ParisF-75013 France
Hofstadter’s G function is recursively defined via G(0) = 0 and then G(n) = n−G(G(n−1)). Following Hofstadter, a family (Fk) of similar functions is obtained by varying the number k of nested recursive calls in this ... 详细信息
来源: 评论
EULER-TYPE RECURRENCES FOR t-COLOR AND t-REGULAR PARTITION functions
arXiv
收藏 引用
arXiv 2024年
作者: Bhowmik, Tapas Tsai, Wei-Lun Ye, Dongxi Department of Mathematics University of South Carolina ColumbiaSC29208 United States Sun Yat-sen University Guangdong Zhuhai519082 China
We give Euler-like recursive formulas for the t-colored partition function when t = 2 or t = 3, as well as for all t-regular partition functions. In particular, we derive an infinite family of "triangular number&... 详细信息
来源: 评论
On the Euler function of linearly recurrent sequences
arXiv
收藏 引用
arXiv 2024年
作者: Luca, Florian Manape, Makoko Campbell Mathematics Division Stellenbosch University Stellenbosch South Africa Centro de Ciencias Matemáticas UNAM Morelia Mexico School of Maths Wits University Johannesburg South Africa
In this paper, we show that if (Un)n≥1 is any nondegenerate linearly recurrent sequence of integers whose general term is up to sign not a polynomial in n, then the inequality φ(|Un|) ≥ |Uφ(n)| holds on a set of p... 详细信息
来源: 评论
Review of a Heaviside step sequence function and the recursive Heaviside step sequence function for modeling human mental state
arXiv
收藏 引用
arXiv 2024年
作者: Shin, Changsoo Department of Energy resources Engineering College of Engineering Seoul National University Korea Republic of
In this paper, we define a novel recursive Heaviside step sequence function and demonstrate its applicability to modeling human mental states such as thought processes, memory recall, and forgetfulness. By extending t... 详细信息
来源: 评论
Algorithmically expressive, always-terminating model for reversible computation
arXiv
收藏 引用
arXiv 2024年
作者: Palazzo, Matteo Roversi, Luca Università degli Studi di Torino Dipartimento di Informatica Italy
Concerning classical computational models able to express all the Primitive recursive functions (PRF), there are interesting results regarding limits on their algorithmic expressiveness or, equivalently, efficiency, n... 详细信息
来源: 评论
Asymptotics of Stochastic Gradient Descent with Dropout Regularization in Linear Models
arXiv
收藏 引用
arXiv 2024年
作者: Li, Jiaqi Schmidt-Hieber, Johannes Wu, Wei Biao Department of Statistics University of Chicago United States Department of Applied Mathematics University of Twente Netherlands
This paper proposes an asymptotic theory for online inference of the stochastic gradient descent (SGD) iterates with dropout regularization in linear regression. Specifically, we establish the geometric-moment contrac... 详细信息
来源: 评论
Towards Fully Automatic Distributed Lower Bounds
arXiv
收藏 引用
arXiv 2024年
作者: Balliu, Alkida Brandt, Sebastian Kuhn, Fabian Olivetti, Dennis Saarhelo, Joonatan Gran Sasso Science Institute Italy CISPA Helmholtz Center for Information Security Germany University of Freiburg Germany
In the past few years, a successful line of research has lead to lower bounds for several fundamental local graph problems in the distributed setting. These results were obtained via a technique called round eliminati... 详细信息
来源: 评论
TOR GROUPS OF THE STANLEY–REISNER RING OF A MATROID
arXiv
收藏 引用
arXiv 2024年
作者: Binder, Kyle Department of Mathematics The Ohio State University United States
We introduce the Tor groups (formula presented) for a loopless matroid M as a way to study the extra relations occurring in the linear ideal of the Feichtner–Yuzvinsky presentation of the Chow ring A•(M). This extend... 详细信息
来源: 评论
The Inverse of Ackermann Function is Computable in Linear Time
收藏 引用
FUNDAMENTA INFORMATICAE 2021年 第3期182卷 345-361页
作者: Sureson, Claude Univ Paris 07 5 Rue Thomas Mann F-75013 Paris France
We propose a detailed proof of the fact that the inverse of Ackermann function is computable in linear time.
来源: 评论