咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是51-60 订阅
排序:
Learning summaries of recursive functions  21
Learning summaries of recursive functions
收藏 引用
21st Asia-Pacific Software Engineering Conference, APSEC 2014
作者: Chen, Yu-Fang Wang, Bow-Yaw Yang, Kai-Chun Institute of Information Science Academia Sinica Taiwan
We describe a learning-based approach for verifying recursive functions. The Boolean formula learning algorithm CDNF is used to automatically infer function summaries for recursive functions. In contrast to traditiona... 详细信息
来源: 评论
Certifying Algorithms and Relevant Properties of Reversible Primitive Permutations with Lean  14th
Certifying Algorithms and Relevant Properties of Reversible ...
收藏 引用
14th International Conference on Reversible Computation (RC)
作者: Maletto, Giacomo Roversi, Luca Univ Torino Dipartimento Matemat Turin Italy Univ Torino Dipartimento Informat Turin Italy
Reversible Primitive Permutations (RPP) are recursively defined functions designed to model Reversible Computation. We illustrate a proof, fully developed with the proof-assistant Lean, certifying that: "RPP can ... 详细信息
来源: 评论
Satisfiability and Synthesis Modulo Oracles  1
收藏 引用
23rd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI) part of the 49th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL)
作者: Polgreen, Elizabeth Reynolds, Andrew Seshia, Sanjit A. Univ Calif Berkeley Berkeley CA 94720 USA Univ Edinburgh Edinburgh Midlothian Scotland Univ Iowa Iowa City IA USA
In classic program synthesis algorithms, such as counter-example-guided inductive synthesis (CEGIS), the algorithms alternate between a synthesis phase and an oracle (verification) phase. Many synthesis algorithms use... 详细信息
来源: 评论
Folding left and right matters: Direct style, accumulators, and continuations
收藏 引用
JOURNAL OF FUNCTIONAL PROGRAMMING 2023年 第1期33卷 e2-e2页
作者: Danvy, Olivier Natl Univ Singapore Yale NUS Coll Singapore Singapore Natl Univ Singapore Sch Comp Singapore Singapore
The equivalence of folding left and right over Peano numbers and lists makes it possible to minimalistically inter-derive (1) structurally recursive functions in direct style, (2) structurally tail-recursive functions... 详细信息
来源: 评论
GENERALIZED HOFSTADTER functions G, H AND BEYOND: NUMERATION SYSTEMS AND DISCREPANCY
arXiv
收藏 引用
arXiv 2025年
作者: Letouzey, Pierre Université Paris Cité CNRS Inria 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 t... 详细信息
来源: 评论
Core Gödel
收藏 引用
Notre Dame Journal of Formal Logic 2023年 第1期64卷 15-59页
作者: Neil Tennant
This study examines how the Gödel phenomena are to be treated in core logic. We show in formal detail how one can use core logic in the metalanguage to prove Gödel’s incompleteness theorems for arithmetic e... 详细信息
来源: 评论
ZEROS AND S-UNITS IN SUMS OF TERMS OF RECURRENCE SEQUENCES IN FUNCTION FIELDS
arXiv
收藏 引用
arXiv 2024年
作者: Darsana, N. Rout, S.S. Department of Mathematics National Institute of Technology Calicut Kozhikode673 601 India
Let (Un)n≥0 be a non-degenerate linear recurrence sequence with order at least two defined over a function field and OS∗ be the set of S-units. In this paper, we use a result of Brownawell and Masser to prove effecti... 详细信息
来源: 评论
COMPLEXITY OF POWERS OF A CONSTANT-recursive SEQUENCE
arXiv
收藏 引用
arXiv 2025年
作者: Rowland, Eric Barrón, Jesús Sistos Department of Mathematics Hofstra University HempsteadNY United States Department of Mathematics University of Georgia AthensGA United States
Constant-recursive sequences are those which satisfy a linear recurrence, so that later terms can be obtained as a linear combination of the previous ones. The rank of a constant-recursive sequence is the minimal numb... 详细信息
来源: 评论
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
arXiv
收藏 引用
arXiv 2024年
作者: Kobayashi, Naoki The University of Tokyo Japan
The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undec... 详细信息
来源: 评论
Binomial Tabulation: A Short Story
arXiv
收藏 引用
arXiv 2025年
作者: Ko, Hsiang-Shang Mu, Shin-Cheng Gibbons, Jeremy Academia Sinica Institute of Information Science 128 Academia Road Taipei115201 Taiwan University of Oxford Department of Computer Science Wolfson Building Parks Road OxfordOX1 3QD United Kingdom
We reconstruct some of the development in Richard Bird’s [2008] paper Zippy Tabulations of recursive functions, using dependent types and string diagrams rather than mere simple types. This paper serves as an intuiti... 详细信息
来源: 评论