Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Weihrauch-completeness for layerwise computability

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2018
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030187299012610
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:5927
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2018
publishDateSort 2018
record_format rss_article
spellingShingle Weihrauch-completeness for layerwise computability
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title Weihrauch-completeness for layerwise computability
title_auth Weihrauch-completeness for layerwise computability
title_full Weihrauch-completeness for layerwise computability
title_fullStr Weihrauch-completeness for layerwise computability
title_full_unstemmed Weihrauch-completeness for layerwise computability
title_short Weihrauch-completeness for layerwise computability
title_sort weihrauch-completeness for layerwise computability
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.23638/LMCS-14(2:11)2018