Incomplete sets in P for logspace-reduction

01/19/2022
by   Reiner Czerwinski, et al.
0

In this article, we investigate the behaviour of TMs with time limit and tape space limit. This problem is in P when the time limit is unary coded. If both limits go to infinity, it is undecidable which limit is exceeded first. Thus logspace-incomplete sets in P can be constructed. This implies L ≠ P.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2019

Extension of Donsker's Invariance Principle with Incomplete Partial-Sum Process

Based on deleting-item central limit theory, the classical Donsker's the...
research
04/22/2022

Optimal Heap Limits for Reducing Browser Memory Use

Garbage collected language runtimes must carefully tune heap limits to r...
research
03/14/2023

Limit Shape of the Generalized Inverse Gaussian-Poisson Distribution

The generalized inverse Gaussian-Poisson (GIGP) distribution proposed by...
research
12/23/2019

Asymptotic Behavior for Textiles in von-Kármán regime

The paper is dedicated to the investigation of simultaneous homogenizati...
research
07/08/2019

Solution Landscapes in the Landau-de Gennes Theory on Rectangles

We study nematic equilibria on rectangular domains, in a reduced two-dim...
research
08/16/2022

A Graph-Based Modelling of Epidemics: Properties, Simulation, and Continuum Limit

This work is concerned with epidemiological models defined on networks, ...
research
03/06/2020

The Graph Limit of The Minimizer of The Onsager-Machlup Functional and Its Computation

The Onsager-Machlup (OM) functional is well-known for characterizing the...

Please sign up or login with your details

Forgot password? Click here to reset