DeepAI AI Chat

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME

08/07/2020

∙

by Neil D. Jones, et al.

∙

Københavns Uni

∙

Radboud Universiteit

∙

Programming language concepts are used to give some new perspectives on a long-standing open problem: is logspace = ptime ?

READ FULL TEXT

Neil D. Jones
1 publication
Siddharth Bhaskar
5 publications
Cynthia Kop
12 publications
Jakob Grue Simonsen
24 publications

page 1

page 2

page 3

page 4

research

∙ 12/13/2022

A programming language characterizing quantum polynomial time

We introduce a first-order quantum programming language, named FOQ, whos...

0 Emmanuel Hainry, et al. ∙

research

∙ 06/04/2015

Programs as Polypeptides

We describe a visual programming language for defining behaviors manifes...

0 Lance R. Williams, et al. ∙

research

∙ 08/09/2017

From Reversible Programs to Univalent Universes and Back

We establish a close connection between a reversible programming languag...

0 Jacques Carette, et al. ∙

research

∙ 11/28/2020

Discrete Math with Programming: A Principled Approach

Discrete mathematics is the foundation of computer science. It focuses o...

0 Yanhong A. Liu, et al. ∙

research

∙ 11/13/2019

Zoea – Composable Inductive Programming Without Limits

Automatic generation of software from some form of specification has bee...

0 Edward McDaid, et al. ∙

research

∙ 08/01/2021

Deciding boundedness of monadic sirups

We show that deciding boundedness (aka FO-rewritability) of monadic sing...

0 Stanislav Kikot, et al. ∙

research

∙ 06/28/2021

A Dictionary-Passing Translation of Featherweight Go

The Go programming language is an increasingly popular language but some...

0 Martin Sulzmann, et al. ∙

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME

Related Research

A programming language characterizing quantum polynomial time

Programs as Polypeptides

From Reversible Programs to Univalent Universes and Back

Discrete Math with Programming: A Principled Approach

Zoea – Composable Inductive Programming Without Limits

Deciding boundedness of monadic sirups

A Dictionary-Passing Translation of Featherweight Go