About: A Turing Machine Distance Hierarchy

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Turing Machine Distance Hierarchy Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	We introduce a new so-called distance complexity measure for Turing machine computations which is sensitive to long-distance transfers of information on the worktape. An important special case of this measure can be interpreted as a kind of buffering complexity which counts the number of necessary block uploads into a virtual buffer on top of worktape. Thus, the distance measure can be used for investigating the buffering aspects of Turing computations. In this paper, we start this study by proving a tight separation and hierarchy result. In particular, we show that a very small increase in the distance complexity bound (roughly from c(n) to c(n + 1) + constant) brings provably more computational power to deterministic or nondeterministic Turing machines. For this purpose, we formulate a very general diagonalization method for Blum-like complexity measures. We also obtain a hierarchy of the distance complexity classes. We introduce a new so-called distance complexity measure for Turing machine computations which is sensitive to long-distance transfers of information on the worktape. An important special case of this measure can be interpreted as a kind of buffering complexity which counts the number of necessary block uploads into a virtual buffer on top of worktape. Thus, the distance measure can be used for investigating the buffering aspects of Turing computations. In this paper, we start this study by proving a tight separation and hierarchy result. In particular, we show that a very small increase in the distance complexity bound (roughly from c(n) to c(n + 1) + constant) brings provably more computational power to deterministic or nondeterministic Turing machines. For this purpose, we formulate a very general diagonalization method for Blum-like complexity measures. We also obtain a hierarchy of the distance complexity classes. (en)
Title	A Turing Machine Distance Hierarchy A Turing Machine Distance Hierarchy (en)
skos:prefLabel	A Turing Machine Distance Hierarchy A Turing Machine Distance Hierarchy (en)
skos:notation	RIV/67985807:_____/13:00383266!RIV14-GA0-67985807
http://linked.open...avai/predkladatel	Ústav informatiky AV ČR, v.v.i.
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GAP202/10/1333), P(GBP202/12/G061)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Šíma, Jiří Žák, Stanislav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav informatiky AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	59170
http://linked.open...ai/riv/idVysledku	RIV/67985807:_____/13:00383266
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Turing machine; hierarchy; distance complexity; diagonalization (en)
http://linked.open.../riv/klicoveSlovo	diagonalization distance complexity Turing machine hierarchy
http://linked.open...ontrolniKodProRIV	[AFEABFA50E96]
http://linked.open...v/mistoKonaniAkce	Bilbao
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	Language and Automata Theory and Applications
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of excellence - Institute for theoretical computer science (CE-ITI) NoSCoM: Non-Standard Computational Models and Their Applications in Complexity, Linguistics, and Learning
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Šíma, Jiří Žák, Stanislav
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-04-02 (xsd:date)
issn	0302-9743
number of pages	9 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-37064-9_50
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-37063-2

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software