Ramified recurrence and computational complexity II: Substitution and poly-space
Identifieur interne : 002E72 ( Istex/Corpus ); précédent : 002E71; suivant : 002E73Ramified recurrence and computational complexity II: Substitution and poly-space
Auteurs : Daniel Leivant ; Jean-Yves MarionSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We prove an applicative characterization of poly-space as the set of functions over $$\mathbb{W} = \{ 0,1\} *$$ defined by ramified $$\mathbb{W}$$ -recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation backwards from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.
Url:
DOI: 10.1007/BFb0022277
Links to Exploration step
ISTEX:C4D17B8F4220C449F48CE138C0F65F9839B0BA3CLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Ramified recurrence and computational complexity II: Substitution and poly-space</title>
<author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name>
<affiliation><mods:affiliation>Department of Computer Science, Indiana University, 47405, Bloomington, IN, USA</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: leivant@cs.indiana.edu</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><mods:affiliation>CRIN - CNRS - INRIA Lorraine, Université Nancy I, 54506, Vandœuvre-lés-Nancy Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Jean-Yves.Marion@loria.fr</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:C4D17B8F4220C449F48CE138C0F65F9839B0BA3C</idno>
<date when="1995" year="1995">1995</date>
<idno type="doi">10.1007/BFb0022277</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-FD85ZKWW-6/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002E72</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E72</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Ramified recurrence and computational complexity II: Substitution and poly-space</title>
<author><name sortKey="Leivant, Daniel" sort="Leivant, Daniel" uniqKey="Leivant D" first="Daniel" last="Leivant">Daniel Leivant</name>
<affiliation><mods:affiliation>Department of Computer Science, Indiana University, 47405, Bloomington, IN, USA</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: leivant@cs.indiana.edu</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation><mods:affiliation>CRIN - CNRS - INRIA Lorraine, Université Nancy I, 54506, Vandœuvre-lés-Nancy Cedex, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: Jean-Yves.Marion@loria.fr</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">Lect Notes Comput Sci</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We prove an applicative characterization of poly-space as the set of functions over $$\mathbb{W} = \{ 0,1\} *$$ defined by ramified $$\mathbb{W}$$ -recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation backwards from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.</div>
</front>
</TEI>
<istex><corpusName>springer-ebooks</corpusName>
<author><json:item><name>Daniel Leivant</name>
<affiliations><json:string>Department of Computer Science, Indiana University, 47405, Bloomington, IN, USA</json:string>
<json:string>E-mail: leivant@cs.indiana.edu</json:string>
</affiliations>
</json:item>
<json:item><name>Jean-Yves Marion</name>
<affiliations><json:string>CRIN - CNRS - INRIA Lorraine, Université Nancy I, 54506, Vandœuvre-lés-Nancy Cedex, France</json:string>
<json:string>E-mail: Jean-Yves.Marion@loria.fr</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/HCB-FD85ZKWW-6</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>ReviewPaper</json:string>
</originalGenre>
<abstract>Abstract: We prove an applicative characterization of poly-space as the set of functions over $$\mathbb{W} = \{ 0,1\} *$$ defined by ramified $$\mathbb{W}$$ -recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation backwards from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.</abstract>
<qualityIndicators><refBibsNative>false</refBibsNative>
<abstractWordCount>87</abstractWordCount>
<abstractCharCount>666</abstractCharCount>
<keywordCount>0</keywordCount>
<score>8.044</score>
<pdfWordCount>6572</pdfWordCount>
<pdfCharCount>33138</pdfCharCount>
<pdfVersion>1.3</pdfVersion>
<pdfPageCount>15</pdfPageCount>
<pdfPageSize>439.28 x 662.28 pts</pdfPageSize>
</qualityIndicators>
<title>Ramified recurrence and computational complexity II: Substitution and poly-space</title>
<chapterId><json:string>35</json:string>
<json:string>Chap35</json:string>
</chapterId>
<genre><json:string>conference</json:string>
</genre>
<serie><title>Lecture Notes in Computer Science</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>1995</copyrightDate>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<editor><json:item><name>Gerhard Goos</name>
</json:item>
<json:item><name>Juris Hartmanis</name>
</json:item>
<json:item><name>Jan van Leeuwen</name>
</json:item>
</editor>
</serie>
<host><title>Computer Science Logic</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>1995</copyrightDate>
<doi><json:string>10.1007/BFb0022242</json:string>
</doi>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<eisbn><json:string>978-3-540-49404-1</json:string>
</eisbn>
<bookId><json:string>3540600175</json:string>
</bookId>
<isbn><json:string>978-3-540-60017-6</json:string>
</isbn>
<volume>933</volume>
<pages><first>486</first>
<last>500</last>
</pages>
<genre><json:string>book-series</json:string>
</genre>
<editor><json:item><name>Leszek Pacholski</name>
</json:item>
<json:item><name>Jerzy Tiuryn</name>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Mathematical Logic and Formal Languages</value>
</json:item>
<json:item><value>Logics and Meanings of Programs</value>
</json:item>
<json:item><value>Artificial Intelligence (incl. Robotics)</value>
</json:item>
<json:item><value>Computation by Abstract Devices</value>
</json:item>
<json:item><value>Mathematical Logic and Foundations</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/HCB-FD85ZKWW-6</json:string>
</ark>
<publicationDate>1995</publicationDate>
<copyrightDate>1995</copyrightDate>
<doi><json:string>10.1007/BFb0022277</json:string>
</doi>
<id>C4D17B8F4220C449F48CE138C0F65F9839B0BA3C</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-FD85ZKWW-6/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-FD85ZKWW-6/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-FD85ZKWW-6/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Ramified recurrence and computational complexity II: Substitution and poly-space</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<availability><licence>Springer-Verlag</licence>
</availability>
<date when="1995">1995</date>
</publicationStmt>
<notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note>
<note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Ramified recurrence and computational complexity II: Substitution and poly-space</title>
<author><persName><forename type="first">Daniel</forename>
<surname>Leivant</surname>
</persName>
<email>leivant@cs.indiana.edu</email>
<affiliation><orgName type="department">Department of Computer Science</orgName>
<orgName type="institution">Indiana University</orgName>
<address><postCode>47405</postCode>
<settlement>Bloomington</settlement>
<region>IN</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Jean-Yves</forename>
<surname>Marion</surname>
</persName>
<email>Jean-Yves.Marion@loria.fr</email>
<affiliation><orgName type="department">CRIN - CNRS - INRIA Lorraine</orgName>
<orgName type="institution">Université Nancy I</orgName>
<address><postCode>54506</postCode>
<settlement>Vandœuvre-lés-Nancy Cedex</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<idno type="istex">C4D17B8F4220C449F48CE138C0F65F9839B0BA3C</idno>
<idno type="ark">ark:/67375/HCB-FD85ZKWW-6</idno>
<idno type="DOI">10.1007/BFb0022277</idno>
</analytic>
<monogr><title level="m" type="main">Computer Science Logic</title>
<title level="m" type="sub">8th Workshop, CSL '94 Kazimierz, Poland, September 25–30, 1994 Selected Papers</title>
<idno type="DOI">10.1007/BFb0022242</idno>
<idno type="book-id">3540600175</idno>
<idno type="ISBN">978-3-540-60017-6</idno>
<idno type="eISBN">978-3-540-49404-1</idno>
<idno type="chapter-id">Chap35</idno>
<editor><persName><forename type="first">Leszek</forename>
<surname>Pacholski</surname>
</persName>
</editor>
<editor><persName><forename type="first">Jerzy</forename>
<surname>Tiuryn</surname>
</persName>
</editor>
<imprint><biblScope unit="vol">933</biblScope>
<biblScope unit="page" from="486">486</biblScope>
<biblScope unit="page" to="500">500</biblScope>
<biblScope unit="chapter-count">38</biblScope>
</imprint>
</monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<title level="s" type="abbrev">Lect Notes Comput Sci</title>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Goos</surname>
</persName>
</editor>
<editor><persName><forename type="first">Juris</forename>
<surname>Hartmanis</surname>
</persName>
</editor>
<editor><persName><forename type="first">Jan</forename>
<nameLink>van</nameLink>
<surname>Leeuwen</surname>
</persName>
</editor>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="seriesID">558</idno>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><abstract xml:lang="en"><head>Abstract</head>
<p>We prove an applicative characterization of poly-space as the set of functions over <formula xml:id="IE1" notation="TEX"><media mimeType="image" url=""></media>
$$\mathbb{W} = \{ 0,1\} *$$
</formula>
defined by ramified <formula xml:id="IE2" notation="TEX"><media mimeType="image" url=""></media>
$$\mathbb{W}$$
</formula>
-recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation <hi rend="italic">backwards</hi>
from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.</p>
</abstract>
<textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label>
<item><term type="Primary">Computer Science</term>
</item>
<label>I16048</label>
<item><term type="Secondary" subtype="priority-1">Mathematical Logic and Formal Languages</term>
</item>
<label>I1603X</label>
<item><term type="Secondary" subtype="priority-2">Logics and Meanings of Programs</term>
</item>
<label>I21017</label>
<item><term type="Secondary" subtype="priority-3">Artificial Intelligence (incl. Robotics)</term>
</item>
<label>I16013</label>
<item><term type="Secondary" subtype="priority-4">Computation by Abstract Devices</term>
</item>
<label>M24005</label>
<item><term type="Secondary" subtype="priority-5">Mathematical Logic and Foundations</term>
</item>
</list>
</keywords>
</textClass>
<langUsage><language ident="EN"></language>
</langUsage>
</profileDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-FD85ZKWW-6/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName>
<PublisherLocation>Berlin, Heidelberg</PublisherLocation>
</PublisherInfo>
<Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesElectronicISSN>1611-3349</SeriesElectronicISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
<SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<FamilyName>Goos</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName>
<FamilyName>Hartmanis</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName>
<Particle>van</Particle>
<FamilyName>Leeuwen</FamilyName>
</EditorName>
</Editor>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Proceedings" TocLevels="0" NumberingStyle="Unnumbered"><BookID>3540600175</BookID>
<BookTitle>Computer Science Logic</BookTitle>
<BookSubTitle>8th Workshop, CSL '94 Kazimierz, Poland, September 25–30, 1994 Selected Papers</BookSubTitle>
<BookVolumeNumber>933</BookVolumeNumber>
<BookDOI>10.1007/BFb0022242</BookDOI>
<BookTitleID>42721</BookTitleID>
<BookPrintISBN>978-3-540-60017-6</BookPrintISBN>
<BookElectronicISBN>978-3-540-49404-1</BookElectronicISBN>
<BookChapterCount>38</BookChapterCount>
<BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName>
<CopyrightYear>1995</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<BookSubject Code="I1603X" Priority="2" Type="Secondary">Logics and Meanings of Programs</BookSubject>
<BookSubject Code="I21017" Priority="3" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject>
<BookSubject Code="I16013" Priority="4" Type="Secondary">Computation by Abstract Devices</BookSubject>
<BookSubject Code="M24005" Priority="5" Type="Secondary">Mathematical Logic and Foundations</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
</BookInfo>
<BookHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>Leszek</GivenName>
<FamilyName>Pacholski</FamilyName>
</EditorName>
</Editor>
<Editor><EditorName DisplayOrder="Western"><GivenName>Jerzy</GivenName>
<FamilyName>Tiuryn</FamilyName>
</EditorName>
</Editor>
</EditorGroup>
</BookHeader>
<Chapter ID="Chap35" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ChapterID>35</ChapterID>
<ChapterDOI>10.1007/BFb0022277</ChapterDOI>
<ChapterSequenceNumber>35</ChapterSequenceNumber>
<ChapterTitle Language="En">Ramified recurrence and computational complexity II: Substitution and poly-space</ChapterTitle>
<ChapterFirstPage>486</ChapterFirstPage>
<ChapterLastPage>500</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName>
<CopyrightYear>1995</CopyrightYear>
</ChapterCopyright>
<ChapterHistory><OnlineDate><Year>2005</Year>
<Month>6</Month>
<Day>15</Day>
</OnlineDate>
</ChapterHistory>
<ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ChapterGrants>
<ChapterContext><SeriesID>558</SeriesID>
<BookID>3540600175</BookID>
<BookTitle>Computer Science Logic</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Daniel</GivenName>
<FamilyName>Leivant</FamilyName>
</AuthorName>
<Contact><Email>leivant@cs.indiana.edu</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Jean-Yves</GivenName>
<FamilyName>Marion</FamilyName>
</AuthorName>
<Contact><Email>Jean-Yves.Marion@loria.fr</Email>
</Contact>
</Author>
<Affiliation ID="Aff1"><OrgDivision>Department of Computer Science</OrgDivision>
<OrgName>Indiana University</OrgName>
<OrgAddress><Postcode>47405</Postcode>
<City>Bloomington</City>
<State>IN</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgDivision>CRIN - CNRS - INRIA Lorraine</OrgDivision>
<OrgName>Université Nancy I</OrgName>
<OrgAddress><Postcode>54506</Postcode>
<City>Vandœuvre-lés-Nancy Cedex</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>We prove an applicative characterization of poly-space as the set of functions over <InlineEquation ID="IE1"><InlineMediaObject><ImageObject FileRef="558_3540600175_Chapter_35_TeX2GIFIE1.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject>
</InlineMediaObject>
<EquationSource Format="TEX">
$$\mathbb{W} = \{ 0,1\} *$$
</EquationSource>
</InlineEquation>
defined by ramified <InlineEquation ID="IE2"><InlineMediaObject><ImageObject FileRef="558_3540600175_Chapter_35_TeX2GIFIE2.gif" Format="GIF" Color="BlackWhite" Type="Linedraw" Rendition="HTML"></ImageObject>
</InlineMediaObject>
<EquationSource Format="TEX">
$$\mathbb{W}$$
</EquationSource>
</InlineEquation>
-recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation <Emphasis Type="Italic">backwards</Emphasis>
from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Ramified recurrence and computational complexity II: Substitution and poly-space</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>Ramified recurrence and computational complexity II: Substitution and poly-space</title>
</titleInfo>
<name type="personal"><namePart type="given">Daniel</namePart>
<namePart type="family">Leivant</namePart>
<affiliation>Department of Computer Science, Indiana University, 47405, Bloomington, IN, USA</affiliation>
<affiliation>E-mail: leivant@cs.indiana.edu</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jean-Yves</namePart>
<namePart type="family">Marion</namePart>
<affiliation>CRIN - CNRS - INRIA Lorraine, Université Nancy I, 54506, Vandœuvre-lés-Nancy Cedex, France</affiliation>
<affiliation>E-mail: Jean-Yves.Marion@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre displayLabel="ReviewPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">1995</dateIssued>
<copyrightDate encoding="w3cdtf">1995</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: We prove an applicative characterization of poly-space as the set of functions over $$\mathbb{W} = \{ 0,1\} *$$ defined by ramified $$\mathbb{W}$$ -recurrence with parameter substitution. Intuitively, parameter substitution allows re-use of space in ways disallowed by ramified recurrence without substitution: it permits capturing by recurrence the flow of computation backwards from accepting configurations, thereby enabling the simulation of parallel (alternating) computing. Conversely, parameter substitution can be simulated by a computation that can repeatedly bifurcate into subcomputations, i.e. by parallelism that can be captured in poly-space.</abstract>
<relatedItem type="host"><titleInfo><title>Computer Science Logic</title>
<subTitle>8th Workshop, CSL '94 Kazimierz, Poland, September 25–30, 1994 Selected Papers</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Leszek</namePart>
<namePart type="family">Pacholski</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jerzy</namePart>
<namePart type="family">Tiuryn</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">1995</copyrightDate>
<issuance>monographic</issuance>
</originInfo>
<subject><genre>Book-Subject-Collection</genre>
<topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic>
</subject>
<subject><genre>Book-Subject-Group</genre>
<topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic>
<topic authority="SpringerSubjectCodes" authorityURI="M24005">Mathematical Logic and Foundations</topic>
</subject>
<identifier type="DOI">10.1007/BFb0022242</identifier>
<identifier type="ISBN">978-3-540-60017-6</identifier>
<identifier type="eISBN">978-3-540-49404-1</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="BookTitleID">42721</identifier>
<identifier type="BookID">3540600175</identifier>
<identifier type="BookChapterCount">38</identifier>
<identifier type="BookVolumeNumber">933</identifier>
<part><date>1995</date>
<detail type="volume"><number>933</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>486</start>
<end>500</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag, 1995</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="family">Goos</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Juris</namePart>
<namePart type="family">Hartmanis</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jan</namePart>
<namePart type="family">van Leeuwen</namePart>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">1995</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag, 1995</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">C4D17B8F4220C449F48CE138C0F65F9839B0BA3C</identifier>
<identifier type="ark">ark:/67375/HCB-FD85ZKWW-6</identifier>
<identifier type="DOI">10.1007/BFb0022277</identifier>
<identifier type="ChapterID">35</identifier>
<identifier type="ChapterID">Chap35</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1995</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource>
<recordOrigin>Springer-Verlag, 1995</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-FD85ZKWW-6/record.json</uri>
</json:item>
</metadata>
</istex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002E72 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002E72 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Corpus |type= RBID |clé= ISTEX:C4D17B8F4220C449F48CE138C0F65F9839B0BA3C |texte= Ramified recurrence and computational complexity II: Substitution and poly-space }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |