AI Chat AI Image Generator AI Video Text to Speech

On First-order Cons-free Term Rewriting and PTIME

11/09/2017

∙

by Cynthia Kop, et al.

∙

∙

In this paper, we prove that (first-order) cons-free term rewriting with a call-by-value reduction strategy exactly characterises the class of PTIME-computable functions. We use this to give an alternative proof of the result by Carvalho and Simonsen which states that cons-free term rewriting with linearity constraints characterises this class.

page 1

page 2

page 3

page 4

research

∙ 01/09/2020

Cops and robbers on 2K_2-free graphs

We prove that the cop number of any 2K_2-free graph is at most 2, which ...

0 Jérémie Turcotte, et al. ∙

research

∙ 03/02/2018

Cantor-Bendixson ranks of countable SFTs

We show that the possible Cantor-Bendixson ranks of countable SFTs are e...

0 Ilkka Törmä, et al. ∙

research

∙ 11/09/2017

Higher-order Cons-free Interpreters

Constructor rewriting systems are said to be cons-free if any constructo...

0 Cynthia Kop, et al. ∙

research

∙ 03/27/2020

A squarefree term not occurring in the Leech sequence

Let < a r r a y > The Leech sequence L is the squarefree sequence ...

0 Benjamin Wells, et al. ∙

research

∙ 07/29/2020

On the computability of ordered fields

In this paper we develop general techniques for classes of computable re...

0 M. V. Korovina, et al. ∙

research

∙ 09/25/2003

Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements

We present the first class of mathematically rigorous, general, fully se...

0 Juergen Schmidhuber, et al. ∙

research

∙ 09/12/2016

First-Order Bayesian Network Specifications Capture the Complexity Class PP

The point of this note is to prove that a language is in the complexity ...

0 Fabio Gagliardi Cozman, et al. ∙