Safe Recursive Set Functions

por Arnold Beckmann · 2015

ciencia ficcionteoria de conjuntos recursion complejidad computacional

Sinopsis

Esta investigación analiza las funciones recursivas seguras sobre conjuntos, estableciendo conexiones con las funciones de crecimiento polinómico y las máquinas de Turing. [semanticscholar.org](https://www.semanticscholar.org/paper/SAFE-RECURSIVE-SET-FUNCTIONS-Beckmann-Buss/139762e64a3c895deba2f36ff6390e44d64ad068)

Sé el primero en valorar este libro.

Más de Arnold Beckmann

Otras obras del mismo autor en el catálogo

Portada de A term rewriting characterization of the polytime functions and related complexity classes

A term rewriting characterization of the polytime functions and related complexity classes

1996

Portada de Exact bounds for lengths of reductions in typed λ-calculus

Exact bounds for lengths of reductions in typed λ-calculus

2001

Portada de Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic

Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic

2009

Portada de Parity Games and Propositional Proofs

Parity Games and Propositional Proofs

2013

Portada de Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning

Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning

2018

Portada de Cyber-Physical Trust Systems Driven by Blockchain

Cyber-Physical Trust Systems Driven by Blockchain

2020

Portada de KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0

KSPMI: A Knowledge-based System for Predictive Maintenance in Industry 4.0

2022

Libros similares

Libros relacionados según distintos criterios de búsqueda

Ver sugerencias

Ayúdame a que yoleo sea sostenible

Hazte mecenas Más información