咨询与建议

限定检索结果

文献类型

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

馆藏范围

  • 1,407 篇 电子文献
  • 11 种 纸本馆藏

日期分布

学科分类号

  • 836 篇 理学
    • 746 篇 数学
    • 95 篇 统计学(可授理学、...
    • 58 篇 物理学
    • 20 篇 系统科学
    • 19 篇 科学技术史(分学科...
    • 13 篇 生物学
    • 11 篇 化学
  • 710 篇 工学
    • 580 篇 计算机科学与技术...
    • 251 篇 软件工程
    • 66 篇 电气工程
    • 54 篇 控制科学与工程
    • 23 篇 电子科学与技术(可...
    • 22 篇 信息与通信工程
    • 12 篇 机械工程
    • 11 篇 力学(可授工学、理...
    • 10 篇 化学工程与技术
    • 9 篇 动力工程及工程热...
    • 6 篇 材料科学与工程(可...
    • 6 篇 建筑学
  • 81 篇 管理学
    • 50 篇 管理科学与工程(可...
    • 24 篇 图书情报与档案管...
    • 9 篇 工商管理
    • 6 篇 公共管理
  • 36 篇 经济学
    • 21 篇 应用经济学
    • 20 篇 理论经济学
  • 29 篇 哲学
    • 26 篇 哲学
  • 12 篇 医学
    • 6 篇 基础医学(可授医学...
    • 6 篇 临床医学
  • 11 篇 法学
    • 11 篇 社会学
  • 9 篇 教育学
    • 6 篇 心理学(可授教育学...
  • 8 篇 农学
  • 6 篇 文学
  • 4 篇 艺术学
  • 2 篇 历史学

主题

  • 1,418 篇 recursive functi...
  • 181 篇 mathematical the...
  • 103 篇 logical theorems
  • 92 篇 recursion
  • 83 篇 algorithms
  • 78 篇 integers
  • 64 篇 natural numbers
  • 64 篇 recursively enum...
  • 57 篇 nasa technical r...
  • 57 篇 (ntrs)
  • 47 篇 arithmetic
  • 46 篇 recursion theory
  • 45 篇 mathematical ind...
  • 43 篇 degree of unsolv...
  • 37 篇 polynomials
  • 32 篇 approximation
  • 29 篇 algebra
  • 27 篇 coefficients
  • 26 篇 predicates
  • 26 篇 symbolic & mathe...

机构

  • 7 篇 natl univ singap...
  • 6 篇 univ maryland de...
  • 5 篇 inria
  • 5 篇 massachusetts in...
  • 5 篇 univ wisconsin d...
  • 5 篇 univ munster ins...
  • 4 篇 massachusetts in...
  • 4 篇 university of ca...
  • 4 篇 univ kaiserslaut...
  • 4 篇 school of comput...
  • 4 篇 università degli...
  • 3 篇 ohio state univ ...
  • 3 篇 institute of mat...
  • 3 篇 univ edinburgh e...
  • 3 篇 university of wi...
  • 3 篇 department of co...
  • 3 篇 natl univ singap...
  • 3 篇 hokkaido univ di...
  • 3 篇 univ chicago dep...
  • 3 篇 purdue universit...

作者

  • 9 篇 stephan frank
  • 8 篇 jain s
  • 7 篇 zeugmann thomas
  • 7 篇 jockusch cg
  • 7 篇 remmel jb
  • 7 篇 wiehagen rolf
  • 6 篇 roversi luca
  • 6 篇 dipaola ra
  • 6 篇 jain sanjay
  • 6 篇 wiehagen r
  • 6 篇 stephan f
  • 5 篇 kutrib martin
  • 5 篇 nipkow tobias
  • 5 篇 herrmann e
  • 5 篇 hu zhenjiang
  • 5 篇 owings jc
  • 5 篇 byerly re
  • 5 篇 freivalds r
  • 4 篇 young pr
  • 4 篇 slaman ta

语言

  • 1,362 篇 英文
  • 41 篇 其他
  • 8 篇 法文
  • 3 篇 中文
  • 2 篇 俄文
  • 1 篇 德文
  • 1 篇 日文
检索条件"主题词=Recursive Functions"
1418 条 记 录,以下是121-130 订阅
排序:
Resilience Modeling by Means of a Set of recursive functions
Resilience Modeling by Means of a Set of Recursive Functions
收藏 引用
Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops
作者: Maria Teresa Signes Pont Juan Manuel Garcia Chamizo Higinio Mora Mora Jeronimo Mora Pascual Departamento de Tecnologia Informatica y Computation Universidad de Alicante
This paper presents a computational framework to approach the resilience properties of the systems in many different domains. The proposal models elementary behaviors of the systems by means of a set of recursive func... 详细信息
来源: 评论
VDM recursive functions in Isabelle/HOL
arXiv
收藏 引用
arXiv 2023年
作者: Freitas, Leo Larsen, Peter Gorm School of Computing Newcastle University United Kingdom DIGIT Aarhus University Department of Engineering Denmark
For recursive functions general principles of induction needs to be applied. Instead of verifying them directly using the Vienna Development Method Specification Language (VDM-SL), we suggest a translation to Isabelle... 详细信息
来源: 评论
Farey recursive functions
arXiv
收藏 引用
arXiv 2020年
作者: Chesebro, Eric Emlen, Cory Ke, Kenton Lafontaine, Denise McKinnie, Kelly Rigby, Catherine
来源: 评论
Regression verification of unbalanced recursive functions with multiple calls (long version)
arXiv
收藏 引用
arXiv 2022年
作者: Sayedoff, Chaked R.J. Strichman, Ofer IE Technion Haifa Israel
Given two programs p1 and p2, typically two versions of the same program, the goal of regression verification is to mark pairs of functions from p1 and p2 that are equivalent, given a definition of equivalence. The mo... 详细信息
来源: 评论
The Undecidability of Pattern Matching in Calculi where Primitive recursive functions are Representable
arXiv
收藏 引用
arXiv 2023年
作者: Dowek, Gilles INRIA France B.P. 105 Le Chesnay78153 Cedex France
We prove that the pattern matching problem is undecidable in polymorphic λ-calculi (as Girard's system F [8] [9]) and calculi supporting inductive types (as Gödel's system T [10] [9]) by reducing Hilbert... 详细信息
来源: 评论
Approximate Degree Composition for recursive functions
arXiv
收藏 引用
arXiv 2024年
作者: Chakraborty, Sourav Kayal, Chandrima Mittal, Rajat Paraashar, Manaswi Saurabh, Nitin Indian Statistical Institute Kolkata India Indian Institute of Technology Kanpur India University of Copenhagen Denmark Indian Institute of Technology Hyderabad India
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate ... 详细信息
来源: 评论
Extensible recursive functions, Algebraically
arXiv
收藏 引用
arXiv 2024年
作者: Hubers, Alex Ingle, Apoorv Marmaduke, Andrew Morris, J. Garrett Department of Computer Science The University of Iowa 14 MacLean Hall Iowa CityIA United States
We explore recursive programming with extensible data types. Row types make the structure of data types first class, and can express a variety of type system features from subtyping to modular combination of case bran... 详细信息
来源: 评论
Theory of recursive functions and effective computability /
Theory of recursive functions and effective computability /
收藏 引用
1967年
作者: Rogers Hartley
来源: 内蒙古大学图书馆图书 评论
PRIMITIVE recursive ORDINAL functions WITH ADDED CONSTANTS
收藏 引用
JOURNAL OF SYMBOLIC LOGIC 1977年 第1期42卷 77-82页
作者: STAHL, SH
One of the basic differences between the primitive recursive functions on the natural numbers and the primitive recursive ordinal functions (PR) is the nearly complete absence of constant functions in PR. Since ω is ... 详细信息
来源: 评论
REAL NUMBERS AND functions IN KLEENE HIERARCHY AND LIMITS OF recursive, RATIONAL functions
收藏 引用
JOURNAL OF SYMBOLIC LOGIC 1969年 第2期34卷 207-&页
作者: SHAPIRO, NZ The Rand Corporation
Let ƒ be a real number. It is well known [7] that the set of rational numbers which are less than ƒ is a recursive set if and only if ƒ is representable as the limit of a recursive, recursively convergent sequence of ... 详细信息
来源: 评论