human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a behavioural theory of recursive algorithms"):
  Abstract: ``What is an algorithm?'' is a fundamental question of computer science. Gurevich's behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives an abstract answer without referring to a particular language or programming style, and shows that sequential algorithms are captured by sequential Abstract State Machines. Moschovakis criticised that recursive algorithms such as mergesort are not covered by this theory, but can be expressed by recursors. In this article we propose a language-independent definition of the notion of recursive algorithm generalising Gurevich's postulates, and prove that recursive algorithms are captured by recursive Abstract State Machines. Furthermore, we show that recursive algorithms are behaviorally equivalent to finitely composed concurrent algorithms all of their runs are partial-order runs.

Includes members:
  Member "behavioural theory of reflective algorithms i reflective sequential algorithms":
    also connected through other hyperedges:
      (none)
  Member "evolving algebras 1993 lipari guide":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "behavioural theory of reflective algorithms i reflective sequential algorithms")
  Member "a new thesis concerning synchronised parallel computing simplified parallel asm thesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "behavioural theory of reflective algorithms i reflective sequential algorithms")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LO(Logic in Computer Science)