咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是121-130 订阅
排序:
The inverse of ackermann function is computable in linear time
arXiv
收藏 引用
arXiv 2021年
作者: Sureson, Claude Université Paris 7 Denis Diderot 5 Rue Thomas Mann Paris75013 France
We propose a detailed proof of the fact that the inverse of Ackermann function is computable in linear *** Codes 03D20, 68Q15 Copyright © 2021, The Authors. All rights reserved.
来源: 评论
Satisfiability and synthesis modulo oracles
arXiv
收藏 引用
arXiv 2021年
作者: Polgreen, Elizabeth Reynolds, Andrew Seshia, Sanjit A. University of Edinburgh University of Iowa UC Berkeley
In classic program synthesis algorithms, such as counterexample-guided inductive synthesis (CEGIS), the algorithms alternate between a synthesis phase and an oracle (verification) phase. Many synthesis algorithms use ... 详细信息
来源: 评论
Resilience modeling by means of a set of recursive functions
Resilience modeling by means of a set of recursive functions
收藏 引用
2013 43rd Annual IEEE/IFIP Conference on Dependable Systems and Networks Workshop, DSN-W 2013
作者: Pont, Maria Teresa Signes Chamizo, Juan Manuel Garcia Mora, Higinio Mora Pascual, Jeronimo Mora Departamento de Tecnología Informática y Computación Universidad de Alicante 03690 San Vicente del Raspeig - Alicante Spain
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... 详细信息
来源: 评论
An overview of the leon verification system: Verification by translation to recursive functions
An overview of the leon verification system: Verification by...
收藏 引用
4th Workshop on Scala, SCALA 2013
作者: Blanc, Régis Kneuss, Etienne Kuncak, Viktor Suter, Philippe Switzerland
We present the Leon verification system for a subset of the Scala programming language. Along with several functional features of Scala, Leon supports imperative constructs such as mutations and loops, using a transla... 详细信息
来源: 评论
Fault Tolerance Tool for Human and Machine Interaction & Application to Civilian Aircraft  6
Fault Tolerance Tool for Human and Machine Interaction & App...
收藏 引用
IEEE Latin American Conference on Computational Intelligence (LA-CCI)
作者: Viana, Javier Cohen, Kelly Univ Cincinnati Dept Aerosp Engn & Engn Mech Cincinnati OH 45221 USA
Enhancing human-machine interaction is critical to aerospace applications. An essential requirement in safety critical systems is the clear need to guarantee trustworthiness of a system as well as V&V (Verificatio... 详细信息
来源: 评论
Pushdown Automata and Constant Height: Decidability and Bounds  21st
Pushdown Automata and Constant Height: Decidability and Boun...
收藏 引用
21st IFIP WG 1.02 International Conference on Descriptional Complexity of Formal Systems (DCFS)
作者: Pighizzini, Giovanni Prigioniero, Luca Univ Milan Dipartimento Informat Milan Italy
It cannot be decided whether a pushdown automaton accepts using constant pushdown height, with respect to the input length, or not. Furthermore, in the case of acceptance in constant height, the height cannot be bound... 详细信息
来源: 评论
Non-recursive Trade-Offs Are "Almost Everywhere"  1
收藏 引用
15th Conference on Computability in Europe (CiE)
作者: Holzer, Markus Kutrib, Martin Univ Giessen Inst Informat Arndtstr 2 D-35392 Giessen Germany
We briefly summarize some of the findings on non-recursive trade-offs, which were first observed by Meyer and Fischer in their seminal paper on "Economy of Description by Automata, Grammars, and Formal Systems&qu... 详细信息
来源: 评论
Unraveling Recursion: Compiling an IR with Recursion to System F  1
收藏 引用
13th International Conference on Mathematics of Program Construction (MPC)
作者: Jones, Michael Peyton Gkoumas, Vasilis Kireev, Roman MacKenzie, Kenneth Nester, Chad Wadler, Philip IOHK Hong Kong Peoples R China Univ Edinburgh Edinburgh Midlothian Scotland
Lambda calculi are often used as intermediate representations for compilers. However, they require extensions to handle higher-level features of programming languages. In this paper we show how to construct an IR base... 详细信息
来源: 评论
Complementary symmetric Rote sequences: the critical exponent and the recurrence function
收藏 引用
Discrete Mathematics and Theoretical Computer Science 2020年 第1期22卷
作者: Dvořáková, Lubomíra Medková, Kateřina Pelantová, Edita FNSPE Czech Technical University Prague Czech Republic
We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions associated with the S-adic representat... 详细信息
来源: 评论
Intuitionistic mathematics and logic
arXiv
收藏 引用
arXiv 2020年
作者: Moschovakis, Joan Rand Vafeiadou, Garyfallia
The first seeds of mathematical intuitionism germinated in Europe over a century ago in the constructive tendencies of Borel, Baire, Lebesgue, Poincaré, Kronecker and others. The flowering was the work of one man... 详细信息
来源: 评论